Parameterized algorithms for finding square roots (Q262249): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00453-014-9967-4 / rank
Normal rank
 
Property / arXiv ID
 
Property / arXiv ID: 1310.5469 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniqueness of graph square roots of girth six / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228228 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving MAX-\(r\)-SAT above a tight lower bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Square Roots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3577833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / 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: Parametrized complexity theory. / 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: 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: Computing square roots of trivially perfect and threshold graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cliques in 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: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for Generating All the Maximal Independent Sets / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00453-014-9967-4 / rank
 
Normal rank

Latest revision as of 12:48, 9 December 2024

scientific article
Language Label Description Also known as
English
Parameterized algorithms for finding square roots
scientific article

    Statements

    Parameterized algorithms for finding square roots (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    29 March 2016
    0 references
    parameterized complexity
    0 references
    graph square root
    0 references
    generalized kernel
    0 references

    Identifiers

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