Characterizations and directed path-width of sequence digraphs (Q6038712): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2900280974 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed path-width of sequence digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Word-Representable Graphs: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing directed pathwidth in \(O(1.89^n)\) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Layouts in Submodular Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Pathwidth of Almost Semicomplete Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the pathwidth of directed graphs with small vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the FIFO stack-up problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5403747 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5572939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed path-width and monotonicity in digraph searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. I. Excluding a forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Finding Embeddings in a <i>k</i>-Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the pathwidth of chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min Cut is NP-complete for edge weighted trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tournament immersion and cutwidth / 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: Digraph searching, directed vertex separation and directed pathwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on exact algorithms for vertex ordering problems on graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:57, 1 August 2024

scientific article; zbMATH DE number 7681311
Language Label Description Also known as
English
Characterizations and directed path-width of sequence digraphs
scientific article; zbMATH DE number 7681311

    Statements

    Characterizations and directed path-width of sequence digraphs (English)
    0 references
    0 references
    0 references
    0 references
    2 May 2023
    0 references
    digraphs
    0 references
    directed path-width
    0 references
    transitive tournaments
    0 references
    XP-algorithm
    0 references

    Identifiers

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