Computing square roots of graphs with low maximum degree (Q2413970): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q259036
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Petr A. Golovach / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2619953306 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1608.06142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Square Roots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized algorithms for finding square roots / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues / 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: Complexity of finding graph roots with girth conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Kernel for Finding Square Roots of Almost Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Cactus Roots in Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Squares of low clique number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite roots of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing Powers of Proper Interval, Split, and Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free split graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to recognize squares of split graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The square of a block graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A good characterization of squares of strongly chordal split graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Square Roots of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of line graphs that are squares of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing square roots of trivially perfect and threshold graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing roots of graphs is hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: The square root of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Square roots of minor closed graph classes / rank
 
Normal rank

Latest revision as of 14:37, 16 July 2024

scientific article
Language Label Description Also known as
English
Computing square roots of graphs with low maximum degree
scientific article

    Statements

    Computing square roots of graphs with low maximum degree (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    17 September 2018
    0 references
    square root
    0 references
    bounded degree graph
    0 references
    polynomial algorithm
    0 references

    Identifiers

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