Journal Articles Algorithmica Year : 2019

Beyond Classes of Graphs with “Few” Minimal Separators: FPT Results Through Potential Maximal Cliques

Domains

Data Structures and Algorithms [cs.DS]

Ioan Todinca  : Connect in order to contact the contributor

https://inria.hal.science/hal-03540659

Submitted on : Monday, January 24, 2022-10:36:35 AM

Last modification on : Thursday, October 17, 2024-8:55:08 AM

No file

Dates and versions

hal-03540659 , version 1 (24-01-2022)

Identifiers

Cite

Mathieu Liedloff, Pedro Montealegre, Ioan Todinca. Beyond Classes of Graphs with “Few” Minimal Separators: FPT Results Through Potential Maximal Cliques. Algorithmica, 2019, 81 (3), pp.986-1005. ⟨10.1007/s00453-018-0453-2⟩. ⟨hal-03540659⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

UNIV-ORLEANS INSA-GROUPE INSA-CVL ANR
9 View
0 Download

Altmetric

Share

More