Complexity classification of some edge modification problems (Q5948964): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q127647158, #quickstatements; #temporary_batch_1721950759712
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4288579 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Application of Duality to Edge-Deletion Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On intervalizing \(k\)-colored graphs for DNA physical mapping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability of graph modification problems for hereditary properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asteroidal Triple-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of some edge deletion problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Sandwich Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of DNA physical mapping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and algorithms for reasoning about time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orienting graphs to optimize reachability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Threshold Numbers and Threshold Completions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The splittance of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526964 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded degree interval sandwich problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The node-deletion problem for hereditary properties is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The approximation of maximum subgraph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some complexity results about threshold graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Approximation Algorithm for the Minimum Fill-In Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4944968 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4036610 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5683627 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414513 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gadgets, Approximation, and Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-Deletion Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Minimum Fill-In is NP-Complete / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127647158 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:56, 26 July 2024

scientific article; zbMATH DE number 1672489
Language Label Description Also known as
English
Complexity classification of some edge modification problems
scientific article; zbMATH DE number 1672489

    Statements

    Complexity classification of some edge modification problems (English)
    0 references
    0 references
    0 references
    0 references
    16 January 2002
    0 references
    This is the complete version of the paper appeared in Lect. Notes Comput. Sci. 1665, 65-77 (1999; Zbl 0952.68112).
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers