Algorithmic aspects of vertex-edge domination in some graphs. (Q6550668)
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: Algorithmic aspects of vertex-edge domination in some graphs. |
scientific article; zbMATH DE number 7860371
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithmic aspects of vertex-edge domination in some graphs. |
scientific article; zbMATH DE number 7860371 |
Statements
Algorithmic aspects of vertex-edge domination in some graphs. (English)
0 references
5 June 2024
0 references
vertex-edge dominating set
0 references
chordal bipartite graph
0 references
undirected path graph
0 references
proper interval graph
0 references
NP-completeness
0 references
APX-completeness
0 references
0.9014534950256348
0 references
0.8953040242195129
0 references
0.8832229375839233
0 references
0.8816133737564087
0 references
