On the complexity of the storyplan problem (Q6078287): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the complexity of the storyplan problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. I. Excluding a forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing trees in a streaming model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Stories in Small Area / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planarity of streamed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Offline Drawing of Dynamic Trees: Algorithmics and Document Integration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward a Theory of Planarity: Hanani-Tutte and Planarity Variants / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vertex separation number of a graph equals its path-width / 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: Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of \(k\)-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved upper bounds for vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms finding tree-decompositions of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of Vertex Elimination on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for drawing a planar graph on a grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advancements on SEFE and partitioned book embedding problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beyond Planar Graphs / rank
 
Normal rank

Latest revision as of 06:37, 3 August 2024

scientific article; zbMATH DE number 7753723
Language Label Description Also known as
English
On the complexity of the storyplan problem
scientific article; zbMATH DE number 7753723

    Statements

    On the complexity of the storyplan problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    24 October 2023
    0 references
    dynamic graph drawing
    0 references
    \textsf{NP}-hardness
    0 references
    parameterized complexity
    0 references

    Identifiers