$O(M\cdot N)$ Algorithms for the Recognition and Isomorphism Problems on Circular-Arc Graphs (Q4842112): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:59, 8 February 2024
scientific article; zbMATH DE number 779127
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | $O(M\cdot N)$ Algorithms for the Recognition and Isomorphism Problems on Circular-Arc Graphs |
scientific article; zbMATH DE number 779127 |
Statements
$O(M\cdot N)$ Algorithms for the Recognition and Isomorphism Problems on Circular-Arc Graphs (English)
0 references
20 February 1996
0 references
circular-arc graphs
0 references
PQ-tree
0 references
