Efficient edge domination on hole-free graphs in polynomial time (Q3557057)
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 edge domination on hole-free graphs in polynomial time |
scientific article; zbMATH DE number 5702189
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient edge domination on hole-free graphs in polynomial time |
scientific article; zbMATH DE number 5702189 |
Statements
Efficient Edge Domination on Hole-Free Graphs in Polynomial Time (English)
0 references
27 April 2010
0 references
efficient edge domination
0 references
dominating induced matching
0 references
chordal bipartite graphs
0 references
weakly chordal graphs
0 references
hole-free graphs
0 references
linear time algorithm
0 references
polynomial time algorithm
0 references
0.8540410995483398
0 references
0.8521950840950012
0 references
0.8426404595375061
0 references
0.8334680795669556
0 references
0.8329917788505554
0 references
