On the complexity of recognizing directed path families (Q967290): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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.2009.03.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2067974691 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of partial directed line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5570136 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3322122 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3941433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3760547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871759 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Almost Linear-Time Algorithm for Graph Realization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some properties of DNA graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on line digraphs and the directed max-cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraphes de chaînes d'aretes d'un arbre / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient PQ-graph algorithm for solving the graph-realization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence matrices and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recognition algorithm for the intersection graphs of directed paths in directed trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recognition algorithm for the intersection graphs of paths in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The edge intersection graphs of paths in a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge and vertex intersection of paths in a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4083461 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection graphs of paths in a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The matroids with the max-flow min-cut property / rank
 
Normal rank
Property / cites work
 
Property / cites work: The arborescence-realization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The underlying graph of a line digraph / rank
 
Normal rank

Latest revision as of 19:25, 2 July 2024

scientific article
Language Label Description Also known as
English
On the complexity of recognizing directed path families
scientific article

    Statements

    On the complexity of recognizing directed path families (English)
    0 references
    0 references
    0 references
    28 April 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    directed line graph
    0 references
    hypergraph 2-colorability
    0 references
    recognition algorithms
    0 references
    directed path family
    0 references
    0 references