Clustering bipartite and chordal graphs: Complexity, sequential and parallel algorithms

DOI10.1016/S0166-218X(98)00094-8MaRDI QIDQ1283779zbMATH OpenFDO

Authors Nesrine Abbas, Lorna Stewart

Publication date 31 May 1999

Published in Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

chordal graphsclustering problems

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• scientific article; zbMATH DE number 617574
• Clustering and domination in perfect graphs
• Clustering minimum biclique completion of a bipartite graph
• scientific article; zbMATH DE number 26490

Cites work

• scientific article; zbMATH DE number 3882470 (Why is no real title available?)
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 4155887 (Why is no real title available?)
• scientific article; zbMATH DE number 43583 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 617574 (Why is no real title available?)
• scientific article; zbMATH DE number 3445275 (Why is no real title available?)
• scientific article; zbMATH DE number 854567 (Why is no real title available?)
• An approximation algorithm for clustering graphs with dominating diametral path
• Bipartite permutation graphs
• Characterizations of strongly chordal graphs
• Circuit partitioning with size and connection constraints
• Domination, independent domination, and duality in strongly chordal graphs
• Efficient algorithms for interval graphs and circular-arc graphs
• Low diameter graph decompositions
• Maximum matching in a convex bipartite graph
• Partitioning trees: Matching, domination, and maximum diameter
• Some parallel algorithms on interval graphs
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

Cited in

(3)

• (Semi-)External Algorithms for Graph Partitioning and Clustering
• Exact algorithms for the minimum \(s\)-club partitioning problem
• Algorithms for graphs with small octopus

This page was built for publication: Clustering bipartite and chordal graphs: Complexity, sequential and parallel algorithms

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