10.9k citations
- Centre National de la Recherche ScientifiqueFR128 papers
- Université Clermont AuvergneFR88 papers
- Institut PascalFR65 papers
- Aix-Marseille UniversitéFR57 papers
- Czech Technical University in PragueCZ54 papers
- Lyon 1 UniversitéFR54 papers
- University of ManchesterGB54 papers
- Brookhaven National LaboratoryUS53 papers
- Charles UniversityCZ53 papers
- Czech Academy of SciencesCZ53 papers
- Johannes Gutenberg University MainzDE53 papers
- Joint Institute for Nuclear ResearchRU53 papers
Showing 2017 · cs.DSShow all
2 papers · 2 filters
cs.DS2017
On the tractability of optimization problems on H-graphs
Fedor V. Fomin, Petr A. Golovach, Jean-Florent Raymond
For a graph , a graph is an -graph if it is an intersection graph of connected subgraphs of some subdivision of . -graphs naturally generalize several important gra…
cs.DS2017
An optimal XP algorithm for Hamiltonian cycle on graphs of bounded clique-width
Benjamin Bergougnoux, Mamadou Moustapha Kanté, O-joung Kwon
In this paper, we prove that, given a clique-width -expression of an -vertex graph, \textsc{Hamiltonian Cycle} can be solved in time . This improves the n…