Graph editing problems with extended regularity constraints (Q526874): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2017.03.019 / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68R10 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6715594 / rank
 
Normal rank
Property / zbMATH Keywords
 
graph algorithms
Property / zbMATH Keywords: graph algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
computational complexity
Property / zbMATH Keywords: computational complexity / rank
 
Normal rank
Property / zbMATH Keywords
 
parameterized complexity
Property / zbMATH Keywords: parameterized complexity / rank
 
Normal rank
Property / zbMATH Keywords
 
graph editing
Property / zbMATH Keywords: graph editing / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2242403838 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1510.03482 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of three edge contraction problems with degree constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a \(\Delta\)-regular supergraph of minimum order / rank
 
Normal rank
Property / cites work
 
Property / cites work: On problems without polynomial kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph isomorphism parameterized by elimination distance to bounded degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum \(k\)-regular induced subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of regular subgraph recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: General factors of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Editing to a planar graph of given degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding first-order properties of locally tree-decomposable structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Win-Win Kernelization for Degree Sequence Completion Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Editing to a Connected Graph of Given Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Editing to a graph of given degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the completeness of a generalized matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Theory and algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519711 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5672936 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The factorization of graphs. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: The parameterized complexity of editing graphs for bounded degeneracy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Editing graphs to satisfy degree constraints: a parameterized approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of finding regular induced subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the complexity of finding regular subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Looking at the stars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractable cases of the extended global cardinality constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding whether a planar graph has a cubic subgraph is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding regular subgraphs in both arbitrary and planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On locating cubic subgraphs in bounded-degree connected bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Short Proof of the Factor Theorem for Finite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning subgraphs with specified valencies / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2017.03.019 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:29, 9 December 2024

scientific article
Language Label Description Also known as
English
Graph editing problems with extended regularity constraints
scientific article

    Statements

    Graph editing problems with extended regularity constraints (English)
    0 references
    0 references
    15 May 2017
    0 references
    graph algorithms
    0 references
    computational complexity
    0 references
    parameterized complexity
    0 references
    graph editing
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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