Graph editing to a given degree sequence (Q507592): 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: Emergence of Scaling in Random Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization Lower Bounds by Cross-Composition / rank
 
Normal rank
Property / cites work
 
Property / cites work: The spanning subgraphs of eulerian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Degree Anonymization by Vertex Addition / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Finding a Large Subgraph under Anonymity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of even/odd subgraph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: General factors of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of Eulerian deletion problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2978505 / 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: Fundamentals of parameterized complexity / 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: A refined complexity analysis of degree anonymization in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Degree Anonymization by Graph Contractions / 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: Q4231923 / rank
 
Normal rank

Revision as of 09:00, 13 July 2024

scientific article
Language Label Description Also known as
English
Graph editing to a given degree sequence
scientific article

    Statements

    Graph editing to a given degree sequence (English)
    0 references
    0 references
    0 references
    6 February 2017
    0 references
    parameterized complexity
    0 references
    graph editing
    0 references
    degree sequence
    0 references

    Identifiers