On 3-pushdown graphs with large separators (Q2277467): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3682518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: On nontrivial separators for \(k\)-page graphs and simulations by nondeterministic one-tape Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Time Versus Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unraveling k-page graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of a Planar Separator Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Lower Bound Arguments for Deterministic and Nondeterministic Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-theoretic properties in computational complexity / rank
 
Normal rank

Revision as of 15:38, 21 June 2024

scientific article
Language Label Description Also known as
English
On 3-pushdown graphs with large separators
scientific article

    Statements

    Identifiers

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