Linear-time algorithm for the paired-domination problem in convex bipartite graphs (Q692884): 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/s00224-011-9378-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2026285219 / rank | |||
Normal rank | |||
Revision as of 01:44, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear-time algorithm for the paired-domination problem in convex bipartite graphs |
scientific article |
Statements
Linear-time algorithm for the paired-domination problem in convex bipartite graphs (English)
0 references
6 December 2012
0 references
graph algorithms
0 references
linear-time algorithms
0 references
paired-domination
0 references
total domination
0 references
convex bipartite graphs
0 references
