Efficient algorithms for minimal disjoint path problems on chordal graphs (Q4882587)
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 algorithms for minimal disjoint path problems on chordal graphs |
scientific article; zbMATH DE number 890704
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithms for minimal disjoint path problems on chordal graphs |
scientific article; zbMATH DE number 890704 |
Statements
Efficient algorithms for minimal disjoint path problems on chordal graphs (English)
0 references
26 August 1996
0 references
minimal paths
0 references
clique
0 references
disjoint paths
0 references
network
0 references
chordal graphs
0 references
algorithm
0 references
0.92898464
0 references
0.9210101
0 references
0.91077536
0 references
0.9098921
0 references
0.9077135
0 references
0.90626526
0 references
0 references
