A width parameter useful for chordal and co-comparability graphs (Q1680525): Difference between revisions

From MaRDI portal
Changed label, description and/or aliases in en, and other parts
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
aliases / en / 0aliases / en / 0
 
A Width Parameter Useful for Chordal and Co-comparability Graphs
description / endescription / en
 
scientific article; zbMATH DE number 6711880
Property / title
 
A Width Parameter Useful for Chordal and Co-comparability Graphs (English)
Property / title: A Width Parameter Useful for Chordal and Co-comparability Graphs (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1485.05139 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-319-53925-6_8 / rank
 
Normal rank
Property / published in
 
Property / published in: WALCOM: Algorithms and Computation / rank
 
Normal rank
Property / publication date
 
5 May 2017
Timestamp+2017-05-05T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 5 May 2017 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6711880 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963271448 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large minors in graphs with given independence number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph classes and Ramsey numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph classes with structured neighborhoods and algorithmic applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating Sets in Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Hadwiger's Number and the Stability Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contraction obstructions for treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-width and tree-width of \(H\)-minor-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete Minors and Independence Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of generalized domination problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted domination of cocomparability graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the mim-width of some graph classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Parallel Algorithms for Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the density of families of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial problem; stability and order for models and theories in infinitary languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Vertex Partitioning Problems on Partial k-Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4288578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Compiling CNFs into Structured Deterministic DNNFs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Satisfiability Problems with a Linear Structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representation of a finite graph by a set of intervals on the real line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular decomposition and transitive orientation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating clique-width and branch-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving #SAT and MAXSAT by Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Call routing and the ratcatcher / rank
 
Normal rank

Latest revision as of 18:18, 14 July 2024

scientific article; zbMATH DE number 6711880
  • A Width Parameter Useful for Chordal and Co-comparability Graphs
Language Label Description Also known as
English
A width parameter useful for chordal and co-comparability graphs
scientific article; zbMATH DE number 6711880
  • A Width Parameter Useful for Chordal and Co-comparability Graphs

Statements

A width parameter useful for chordal and co-comparability graphs (English)
0 references
A Width Parameter Useful for Chordal and Co-comparability Graphs (English)
0 references
0 references
0 references
0 references
0 references
0 references
16 November 2017
0 references
5 May 2017
0 references
0 references
0 references
0 references
0 references
0 references
mim-width
0 references
sim-width
0 references
chordal graphs
0 references
co-comparability graphs
0 references
XP algorithm
0 references
0 references
0 references
0 references
0 references
0 references