- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
1 Online-Ressource.
- Language
-
Englisch
- Bibliographic citation
-
Domination and Cut Problems on Chordal Graphs with Bounded Leafage ; volume:86 ; number:5 ; day:29 ; month:12 ; year:2023 ; pages:1428-1474 ; date:5.2024
Algorithmica ; 86, Heft 5 (29.12.2023), 1428-1474, 5.2024
- Creator
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s00453-023-01196-y
- URN
-
urn:nbn:de:101:1-2407022115132.380644522432
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.20242024, 11:01 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Galby, Esther
- Marx, Dániel
- Schepper, Philipp
- Sharma, Roohani
- Tale, Prafullkumar
- SpringerLink (Online service)
Other Objects (12)
Domination and cut problems on chordal graphs with bounded leafage
Domination and cut problems on chordal graphs with bounded leafage
Cut problems on graphs
Domination problems on special graph classes
Total Domination Versus Domination in Cubic Graphs
Multiple domination in graphs
Multiple domination in graphs
On domination in graphs
From w-Domination in Graphs to Domination Parameters in Lexicographic Product Graphs
Approximation algorithms for network design and cut problems in bounded-treewidth
A Graph Class related to the Structural Domination Problem
Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-Width
Domination and cut problems on chordal graphs with bounded leafage
Domination and cut problems on chordal graphs with bounded leafage
Cut problems on graphs
Domination problems on special graph classes
Total Domination Versus Domination in Cubic Graphs
Multiple domination in graphs
Multiple domination in graphs
On domination in graphs
From w-Domination in Graphs to Domination Parameters in Lexicographic Product Graphs
Approximation algorithms for network design and cut problems in bounded-treewidth
A Graph Class related to the Structural Domination Problem
Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-Width
Domination and cut problems on chordal graphs with bounded leafage
Domination and cut problems on chordal graphs with bounded leafage
Cut problems on graphs
Domination problems on special graph classes
Total Domination Versus Domination in Cubic Graphs
Multiple domination in graphs
Multiple domination in graphs
On domination in graphs
From w-Domination in Graphs to Domination Parameters in Lexicographic Product Graphs
Approximation algorithms for network design and cut problems in bounded-treewidth
A Graph Class related to the Structural Domination Problem