Mim-width. I. Induced path problems (Q2174563): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q127465558, #quickstatements; #temporary_batch_1721940658196
 
(4 intermediate revisions by 4 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.1016/j.dam.2019.06.026 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2962055031 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting fixed patterns in chordal graphs in polynomial time / 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: Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3577833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(k\)-in-a-path problem for claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for maximum weight induced paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced disjoint paths in AT-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced disjoint paths in circular-arc graphs in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved algorithm for the longest induced path problem on \(k\)-chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton Paths in Grid Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mim-width. III. Graph powers and generalized distance domination problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mim-width. II. The feedback vertex set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5111880 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3304141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A width parameter useful for chordal and co-comparability graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Induced Disjoint Paths Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Hamiltonian circuits in interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: HAMILTONian circuits in chordal bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XIII: The disjoint paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness of computing width parameters based on branch decompositions over the vertex set / 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: The point-set embeddability problem for plane graphs / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127465558 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:57, 25 July 2024

scientific article
Language Label Description Also known as
English
Mim-width. I. Induced path problems
scientific article

    Statements

    Mim-width. I. Induced path problems (English)
    0 references
    0 references
    0 references
    0 references
    21 April 2020
    0 references
    graph width parameters
    0 references
    graph classes
    0 references
    induced paths
    0 references
    induced topological minors
    0 references
    Hamiltonian cycle
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references