The induced matching and chain subgraph cover problems for convex bipartite graphs (Q995582)
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: The induced matching and chain subgraph cover problems for convex bipartite graphs |
scientific article; zbMATH DE number 5186621
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The induced matching and chain subgraph cover problems for convex bipartite graphs |
scientific article; zbMATH DE number 5186621 |
Statements
The induced matching and chain subgraph cover problems for convex bipartite graphs (English)
0 references
3 September 2007
0 references
chain cover
0 references
induced matching
0 references
convex bipartite graph
0 references
0.8316028714179993
0 references
0.82119220495224
0 references
0.8170632123947144
0 references
0.8127500414848328
0 references
0.8065473437309265
0 references
