Editing to Eulerian graphs (Q896016): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1410.6863 / 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: The spanning subgraphs of eulerian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-completeness results for edge modification problems / 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: Parameterized complexity of even/odd subgraph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Deficiency of Housing Markets with Duplicate Houses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Eulerian strong component arc deletion problem on tournaments / 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: Efficient Algorithms for Eulerian Extension and Rural Postman / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parametrized Complexity of Some Fundamental Problems in Coding Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching, Euler tours and the Chinese postman / 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: Finding Even Subgraphs Even Faster / rank
 
Normal rank
Property / cites work
 
Property / cites work: The splittance of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Eulerian extensions and their application to no-wait flowshop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519709 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Eulerian exposition / 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: 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: Complexity classification of some edge modification problems / rank
 
Normal rank

Latest revision as of 04:29, 11 July 2024

scientific article
Language Label Description Also known as
English
Editing to Eulerian graphs
scientific article

    Statements

    Editing to Eulerian graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 December 2015
    0 references
    Eulerian graphs
    0 references
    graph editing
    0 references
    polynomial algorithm
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers