The complexity of two graph orientation problems (Q412352): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C38 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C83 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C12 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6030389 / rank
 
Normal rank
Property / zbMATH Keywords
 
graph orientation
Property / zbMATH Keywords: graph orientation / rank
 
Normal rank
Property / zbMATH Keywords
 
diameter
Property / zbMATH Keywords: diameter / rank
 
Normal rank
Property / zbMATH Keywords
 
planar graph
Property / zbMATH Keywords: planar graph / rank
 
Normal rank
Property / zbMATH Keywords
 
graph minors
Property / zbMATH Keywords: graph minors / rank
 
Normal rank
Property / zbMATH Keywords
 
apex graph
Property / zbMATH Keywords: apex graph / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2112534214 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1004.2478 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy problems for tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4291429 / 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: Separating systems and oriented graphs of diameter two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distances in orientations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385531 / 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: The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. VIII: Orientations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3077955 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bidimensional Parameters and Local Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameter and treewidth in minor-closed graph families, revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearity of grid minors in treewidth with applications through bidimensionality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the Oriented Diameter of a Planar Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameter and treewidth in minor-closed graph families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of approximating the oriented diameter of chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up / rank
 
Normal rank
Property / cites work
 
Property / cites work: On orientations and shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal orientations of graphs and digraphs: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minor theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. III. Planar tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quickly excluding a planar graph / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:03, 5 July 2024

scientific article
Language Label Description Also known as
English
The complexity of two graph orientation problems
scientific article

    Statements

    The complexity of two graph orientation problems (English)
    0 references
    0 references
    0 references
    4 May 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    graph orientation
    0 references
    diameter
    0 references
    planar graph
    0 references
    graph minors
    0 references
    apex graph
    0 references
    0 references
    0 references