An Efficient Algorithm to Generate all Maximal Cliques on Trapezoid Graphs
DOI10.1080/00207160212707zbMATH Open1001.05109OpenAlexW1974703933MaRDI QIDQ3147308FDOQ3147308
Authors: Debashis Bera, Madhumangal Pal, Tapan K. 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
Recommendations
- An efficient algorithm to generate all maximal independent sets on trapezoid graphs
- Trapezoid graphs and generalizations, geometry and algorithms
- Trapezoid graphs and generalizations, geometry and algorithms
- Efficient maximum matching algorithms for trapezoid graphs
- Trapezoid graphs and their coloring
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Title not available (Why is that?)
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Trapezoid graphs and their coloring
- On the 2-Chain Subgraph Cover and Related Problems
- On the structure of trapezoid graphs
- Title not available (Why is that?)
- An efficient algorithm to generate all maximal independent sets on trapezoid graphs
- Efficient parallel algorithms for finding maximal cliques, clique trees, and minimum coloring on chordal graphs
- Fast Parallel Algorithms for Chordal Graphs
Cited In (7)
- Efficient algorithm for the vertex connectivity of trapezoid graphs
- Counting the number of vertex covers in a trapezoid graph
- Efficient algorithms for the minimum connected domination on trapezoid graphs
- Trapezoid graphs and generalizations, geometry and algorithms
- An efficient algorithm to solve connectivity problem on trapezoid graphs
- Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach
- Max-min weight balanced connected partition
This page was built for publication: An Efficient Algorithm to Generate all Maximal Cliques on Trapezoid Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3147308)
