k best cuts for circular-arc graphs

DOI10.1007/BF02526033MaRDI QIDQ1355722zbMATH OpenOpenAlexFDO

Authors O. Diekmann

Publication date 17 August 1997

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02526033

zbMATH Keywords

best cuts for circular-arcs problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 1555975
• Minimum Cuts for Circular-Arc Graphs
• An 0(n log n\(+m\,\log \,\log \,n)\) maximum weight clique algorithm for circular-arc graphs
• AnO(m+nlogn) Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs
• Linear time algorithms on circular-arc graphs

Cites work

• Geometric applications of a matrix-searching algorithm
• Geometric complexity of some location problems
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• Minimum Cuts for Circular-Arc Graphs
• On locating new facilities in a competitive environment
• Optimal parallel algorithms on circular-arc graphs

Cited in

(5)

• Power domination in circular-arc graphs
• A linear-time algorithm for finding locally connected spanning trees on circular-arc graphs
• On interval and circular-arc covering problems
• Minimum Cuts for Circular-Arc Graphs
• scientific article; zbMATH DE number 1555975 (Why is no real title available?)

Describes a project that uses

Uses Software

• Isolde

This page was built for publication: \(k\) best cuts for circular-arc graphs

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