A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs (Q4561265)
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 Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs |
scientific article; zbMATH DE number 6989224
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs |
scientific article; zbMATH DE number 6989224 |
Statements
A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs (English)
0 references
5 December 2018
0 references
greedy algorithms
0 references
lexicographic depth first search
0 references
perfect graphs
0 references
interval graphs
0 references
0 references
0 references
0 references
0 references
