An Efficient Algorithm to Generate all Maximal Cliques on Trapezoid Graphs

DOI10.1080/00207160212707zbMath1001.05109OpenAlexW1974703933MaRDI QIDQ3147308

Madhumangal Pal, Debashis Bera, Tapan Kumar Pal

Publication date: 11 December 2002

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160212707

zbMATH Keywords

algorithmtrapezoid graphmaximal clique

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (6)

Efficient algorithms for the minimum connected domination on trapezoid graphs ⋮ Max-min weight balanced connected partition ⋮ Efficient algorithm for the vertex connectivity of trapezoid graphs ⋮ An efficient algorithm to solve connectivity problem on trapezoid graphs ⋮ Counting the number of vertex covers in a trapezoid graph ⋮ Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach

Cites Work

• Efficient parallel algorithms for finding maximal cliques, clique trees, and minimum coloring on chordal graphs
• Trapezoid graphs and their coloring
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• On the structure of trapezoid graphs
• Fast Parallel Algorithms for Chordal Graphs
• An efficient algorithm to generate all maximal independent sets on trapezoid graphs
• On the 2-Chain Subgraph Cover and Related Problems
• Unnamed Item
• Unnamed Item

This page was built for publication: An Efficient Algorithm to Generate all Maximal Cliques on Trapezoid Graphs