Grad and classes with bounded expansion. II: Algorithmic aspects (Q2426457): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Color-coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar orientations with low out-degree and compaction of adjacency matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix multiplication via arithmetic progressions / 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: Q4942652 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excluding any graph as a minor allows a low tree-width 2-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4886099 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgraph Isomorphism in Planar Graphs and Related Problems / 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: S-functions for graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4027167 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Separator Theorem for Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Separators for Finite-Element Meshes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grad and classes with bounded expansion. I: Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Grad of a Graph and Classes with Bounded Expansion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time low tree-width partitions and algorithmic consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-depth, subgraph coloring and homomorphism bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3688439 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small Diameters of Duals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4028099 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128907 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. I. Excluding a forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XVI: Excluding a non-planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal node ranking of tree in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial aspects of geometric graphs / rank
 
Normal rank

Latest revision as of 20:57, 27 June 2024

scientific article
Language Label Description Also known as
English
Grad and classes with bounded expansion. II: Algorithmic aspects
scientific article

    Statements

    Grad and classes with bounded expansion. II: Algorithmic aspects (English)
    0 references
    22 April 2008
    0 references

    Identifiers

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