A carregar...
Parameterized Complexity of Eulerian Deletion Problems
We study a family of problems where the goal is to make a graph Eulerian, i.e., connected and with all the vertices having even degrees, by a minimum number of deletions. We completely classify the parameterized complexity of various versions: undirected or directed graphs, vertex or edge deletions,...
Na minha lista:
| Main Authors: | , , , , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
Springer US
2012
|
| Assuntos: | |
| Acesso em linha: | https://ncbi.nlm.nih.gov/pmc/articles/PMC3883159/ https://ncbi.nlm.nih.gov/pubmed/24415818 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/s00453-012-9667-x |
| Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|