Editing to Eulerian graphs
From MaRDI portal
Publication:896016
DOI10.1016/J.JCSS.2015.10.003zbMath1346.05150arXiv1410.6863OpenAlexW200506746MaRDI QIDQ896016
Petr A. Golovach, Daniël Paulusma, Konrad K. Dabrowski, Pim van 't Hof
Publication date: 11 December 2015
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1410.6863
Related Items (3)
Plane augmentation of plane graphs to meet parity constraints ⋮ A survey of parameterized algorithms and the complexity of edge modification ⋮ Editing to a planar graph of given degrees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Editing graphs to satisfy degree constraints: a parameterized approach
- Parameterized Eulerian strong component arc deletion problem on tournaments
- Parameterized complexity of three edge contraction problems with degree constraints
- Parameterized complexity of even/odd subgraph problems
- Parameterized complexity of finding regular induced subgraphs
- The node-deletion problem for hereditary properties is NP-complete
- The splittance of a graph
- Fixed-parameter tractability of graph modification problems for hereditary properties
- Editing to a graph of given degrees
- On Eulerian extensions and their application to no-wait flowshop scheduling
- Parameterized complexity of Eulerian deletion problems
- NP-completeness results for edge modification problems
- Editing to a Connected Graph of Given Degrees
- Computing the Deficiency of Housing Markets with Duplicate Houses
- Win-Win Kernelization for Degree Sequence Completion Problems
- An Eulerian exposition
- The spanning subgraphs of eulerian graphs
- Matching, Euler tours and the Chinese postman
- The Parametrized Complexity of Some Fundamental Problems in Coding Theory
- Finding Even Subgraphs Even Faster
- Efficient Algorithms for Eulerian Extension and Rural Postman
- Complexity classification of some edge modification problems
This page was built for publication: Editing to Eulerian graphs
