FixCon: A Generic Solver for Fixed-Cardinality Subgraph Problems

DOI10.1137/1.9781611976007.2MaRDI QIDQ5147488zbMATH OpenOpenAlexFDO

Authors Christian Komusiewicz, Frank Sommer

Publication date 27 January 2021

Published in 2020 Proceedings of the Twenty-Second Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611976007.2

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(3)

• Enumerating connected induced subgraphs: improved delay and experimental comparison
• Fixcon
• Ensuring connectedness for the maximum quasi-clique and densest k-subgraph problems

Describes a project that uses

Uses Software

• KONECT
• Kavosh
• FANMOD

This page was built for publication: FixCon: A Generic Solver for Fixed-Cardinality Subgraph Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5147488)