Structure of conflict graphs in constraint alignment problems and algorithms

MaRDI QIDQ5207847zbMATH OpenFDO

Authors Ferhat Alkan, Türker Bıyıkoğlu, Marc Demange, Cesim Erten

Publication date 13 January 2020

Full work available at URL https://arxiv.org/abs/1403.7948, https://dmtcs.episciences.org/5755/pdf

zbMATH Keywords

\(H\)-free graphsconflict graphconstrained alignmentsfunctional orthologsgraph algorithmsgraph alignmentmaximum independent setprotein-protein interaction networks

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory (05C90)

Recommendations

• Vertex cover in conflict graphs
• Maximum weight edge-constrained matchings
• Vertex Cover in Conflict Graphs: Complexity and a Near Optimal Approximation
• Clustering with center constraints
• Approximation for vertex cover in -conflict graphs

Cited in

(2)

• Hypergraph conflict analysis
• Conflict Anticipation in the Search for Graph Automorphisms

This page was built for publication: Structure of conflict graphs in constraint alignment problems and algorithms

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