Efficient Edge Domination on Hole-Free Graphs in Polynomial Time (Q3557057): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:41, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient Edge Domination on Hole-Free Graphs in Polynomial Time |
scientific article |
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
