Acyclic matchings in subclasses of bipartite graphs (Q4903635)
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: Acyclic matchings in subclasses of bipartite graphs |
scientific article; zbMATH DE number 6128408
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Acyclic matchings in subclasses of bipartite graphs |
scientific article; zbMATH DE number 6128408 |
Statements
ACYCLIC MATCHINGS IN SUBCLASSES OF BIPARTITE GRAPHS (English)
0 references
24 January 2013
0 references
graph algorithms
0 references
acyclic matching
0 references
chain graphs
0 references
bipartite permutation graphs
0 references
perfect elimination bipartite graphs
0 references
NP-complete
0 references
0.9082043766975404
0 references
0.8563687801361084
0 references
0.8408977389335632
0 references
0.7959593534469604
0 references
0.7764381766319275
0 references
