Efficient reduction for path problems on circular-arc graphs (Q802884)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient reduction for path problems on circular-arc graphs |
scientific article; zbMATH DE number 4199649
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient reduction for path problems on circular-arc graphs |
scientific article; zbMATH DE number 4199649 |
Statements
Efficient reduction for path problems on circular-arc graphs (English)
0 references
1991
0 references
interval graphs
0 references
parity path problem
0 references
two path problem
0 references
0.9062554
0 references
0.8953384
0 references
0.8876216
0 references
0.88741827
0 references
0.88741827
0 references
0.88653404
0 references
0.8850889
0 references
0.88320076
0 references
