Solving the weighted efficient edge domination problem on bipartite permutation graphs (Q1270782)
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: Solving the weighted efficient edge domination problem on bipartite permutation graphs |
scientific article; zbMATH DE number 1218477
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving the weighted efficient edge domination problem on bipartite permutation graphs |
scientific article; zbMATH DE number 1218477 |
Statements
Solving the weighted efficient edge domination problem on bipartite permutation graphs (English)
0 references
23 April 1999
0 references
It is shown that the efficient edge domination problem is NP-complete even on bipartite graphs and that the weighted efficient edge domination problem on bipartite permutation graphs can be solved in linear time.
0 references
efficient edge domination
0 references
NP-complete
0 references
bipartite graphs
0 references
bipartite permutation graphs
0 references
0 references
0 references
0 references
