Practical algorithms on partial k-trees with an application to domination-like problems (Q5060153): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/3-540-57155-8_284 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1580414818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy problems for tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization and Recognition of Partial 3-Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time algorithms for NP-hard problems restricted to partial k- trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time computation of optimal subgraphs of decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3795218 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms finding tree-decompositions of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3198869 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time computability of combinatorial problems on series-parallel graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:47, 31 July 2024

scientific article; zbMATH DE number 7643421
Language Label Description Also known as
English
Practical algorithms on partial k-trees with an application to domination-like problems
scientific article; zbMATH DE number 7643421

    Statements

    Identifiers