Q5090996 (Q5090996): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Distance-hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: TWO THEOREMS IN GRAPH THEORY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree- and forest-perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3222224 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing maximum stable sets for distance-hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Recognition Algorithm for Cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4608071 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching and multidimensional matching in chordal and strongly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple paradigm for graph recognition: Application to cographs and distance hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4373681 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitiv orientierbare Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of the algorithmic aspects of modular decomposition / 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: Q4501560 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model counting for CNF formulas of bounded modular treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-width of graphs defined by one-vertex extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(\(n\)) time algorithm for maximum matching on cographs / rank
 
Normal rank

Revision as of 16:33, 29 July 2024

scientific article; zbMATH DE number 7561360
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 7561360

    Statements

    0 references
    0 references
    21 July 2022
    0 references
    maximum matching
    0 references
    FPT in P
    0 references
    modular decomposition
    0 references
    pruned graphs
    0 references
    one-vertex extensions
    0 references
    \(P_4\)-structure
    0 references

    Identifiers