Circular permutation graph family with applications (Q1208459): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: An efficient algorithm for maxdominance, with applications / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3312283 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3328583 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A fast algorithm for computing longest common subsequences / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Optimal Algorithm for the Maximum Two-Chain Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3992847 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Circular permutation graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Comparability and Permutation Graphs / rank | |||
Normal rank | |||
Revision as of 15:24, 17 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Circular permutation graph family with applications |
scientific article |
Statements
Circular permutation graph family with applications (English)
0 references
16 May 1993
0 references
recognition algorithm
0 references
chain problem
0 references
dominance problem
0 references
circular permutation diagram
0 references
intersection graph
0 references
circular permutation graph
0 references
labeled graph
0 references
maximum independent set
0 references
maximum clique
0 references
chromatic number
0 references
