Efficient Edge Domination on Hole-Free Graphs in Polynomial Time (Q3557057): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-642-12200-2_56 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1546403474 / rank | |||
Normal rank | |||
Latest revision as of 18:10, 19 March 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
