Independent Domination: Reductions from Circular- and Triad-Convex Bipartite Graphs to Convex Bipartite Graphs (Q5405924): 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-38756-2_16 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2173684163 / rank | |||
Normal rank | |||
Latest revision as of 23:51, 19 March 2024
scientific article; zbMATH DE number 6279069
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Independent Domination: Reductions from Circular- and Triad-Convex Bipartite Graphs to Convex Bipartite Graphs |
scientific article; zbMATH DE number 6279069 |
Statements
Independent Domination: Reductions from Circular- and Triad-Convex Bipartite Graphs to Convex Bipartite Graphs (English)
0 references
3 April 2014
0 references
independent domination
0 references
circular convex bipartite graph
0 references
triad convex bipartite graph
0 references
polynomial-time reduction
0 references
