P.A. Golovach
Increasing the Minimum Degree of a Graph by Contractions
Golovach, P.A.; Kaminski, M.; Paulusma, D.; Thilikos, D.M.
Citation
Golovach, P., Kaminski, M., Paulusma, D., & Thilikos, D. (2011, September). Increasing the Minimum Degree of a Graph by Contractions. Presented at IPEC 2011: Parameterized and Exact Computation, Saarbrücken, Germany
Presentation Conference Type | Conference Paper (published) |
---|---|
Conference Name | IPEC 2011: Parameterized and Exact Computation |
Start Date | Sep 6, 2011 |
End Date | Sep 8, 2011 |
Publication Date | 2011 |
Deposit Date | Dec 21, 2014 |
Print ISSN | 0302-9743 |
Publisher | Springer |
Peer Reviewed | Peer Reviewed |
Volume | 7112 |
Pages | 67-79 |
Series ISSN | 0302-9743,1611-3349 |
Book Title | Parameterized and Exact Computation |
ISBN | 978-3-642-28049-8 |
DOI | https://doi.org/10.1007/978-3-642-28050-4_6 |
Public URL | https://durham-repository.worktribe.com/output/1153404 |
You might also like
Computing balanced solutions for large international kidney exchange schemes
(2024)
Journal Article
An Algorithmic Framework for Locally Constrained Homomorphisms
(2024)
Journal Article
Solving problems on generalized convex graphs via mim-width
(2023)
Journal Article
The Complexity of Matching Games: A Survey
(2023)
Journal Article
Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs
(2023)
Journal Article
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search