A faster algorithm to recognize undirected path graphs (Q2367409)
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: A faster algorithm to recognize undirected path graphs |
scientific article; zbMATH DE number 243571
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A faster algorithm to recognize undirected path graphs |
scientific article; zbMATH DE number 243571 |
Statements
A faster algorithm to recognize undirected path graphs (English)
0 references
10 August 1993
0 references
intersection graph
0 references
chordal graphs
0 references
undirected path graphs
0 references
0 references
0 references
0.8184666633605957
0 references
0.7961362600326538
0 references
