Packing paths perfectly (Q757434)
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: Publication:757434 |
scientific article; zbMATH DE number 4191720
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Packing paths perfectly |
scientific article; zbMATH DE number 4191720 |
Statements
Packing paths perfectly (English)
0 references
1990
0 references
A class of graphs is characterized in which the largest number of vertex- disjoint paths of length two can be found in polynomial time. Membership in this class can be tested in polynomial time.
0 references
algorithm
0 references
largest number of vertex-disjoint paths
0 references
0.8030034899711609
0 references
0.8012316226959229
0 references
0.7840539216995239
0 references
