An efficient algorithm to solve connectivity problem on trapezoid graphs (Q2454971)
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: An efficient algorithm to solve connectivity problem on trapezoid graphs |
scientific article; zbMATH DE number 5202653
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient algorithm to solve connectivity problem on trapezoid graphs |
scientific article; zbMATH DE number 5202653 |
Statements
An efficient algorithm to solve connectivity problem on trapezoid graphs (English)
0 references
22 October 2007
0 references
design and analysis of algorithm
0 references
trapezpoid graph
0 references
connected components
0 references
vertex connectivity
0 references
0 references
0.96285164
0 references
0.9275975
0 references
0.91469556
0 references
0 references
0.89322567
0 references
0.8909638
0 references
0.89094806
0 references
