Yüklüyor......
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,...
Kaydedildi:
| Asıl Yazarlar: | , , , , |
|---|---|
| Materyal Türü: | Artigo |
| Dil: | Inglês |
| Baskı/Yayın Bilgisi: |
Springer US
2012
|
| Konular: | |
| Online Erişim: | 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 |
| Etiketler: |
Etiketle
Etiket eklenmemiş, İlk siz ekleyin!
|