On the parameterized complexity of the structure of lineal topologies (depth-first spanning trees) of finite graphs: the number of leaves (Q6057351): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-031-30448-4_25 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4366958280 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Linear Time Minor Tests with Depth-First Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bandwidth problem for graphs and matrices—a survey / 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: Linear time solvable optimization problems on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3077955 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trémaux Trees and Planarity / rank
 
Normal rank
Property / cites work
 
Property / cites work: TRÉMAUX TREES AND PLANARITY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trémaux trees and planarity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal Spanning Trees, Aronszajn Trees and Excluded Minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Tractability and Completeness I: Basic Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Flow and Testing Graph Connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding optimal and near-optimal lineal spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collaborating with Hans: Some Remaining Wonderments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of planar graphs by Trémaux orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing Number is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Planarity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elements of finite model theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4552272 / rank
 
Normal rank

Latest revision as of 01:45, 3 August 2024

scientific article; zbMATH DE number 7745718
Language Label Description Also known as
English
On the parameterized complexity of the structure of lineal topologies (depth-first spanning trees) of finite graphs: the number of leaves
scientific article; zbMATH DE number 7745718

    Statements

    On the parameterized complexity of the structure of lineal topologies (depth-first spanning trees) of finite graphs: the number of leaves (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 October 2023
    0 references
    DFS tree
    0 references
    spanning tree
    0 references
    parameterized complexity
    0 references

    Identifiers