An efficient algorithm to generate all maximal independent sets on trapezoid graphs
From MaRDI portal
Publication:4240618
DOI10.1080/00207169908804777zbMATH Open0923.68094OpenAlexW2073015256MaRDI QIDQ4240618FDOQ4240618
Authors: Mrinmoy Hota, Madhumangal Pal, Tapan K. Pal 
Publication date: 25 October 1999
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207169908804777
Recommendations
- An Efficient Algorithm to Generate all Maximal Cliques on Trapezoid Graphs
- Fast algorithms for generating all maximal independent sets of interval, circular-arc and chordal graphs
- On generating all maximal independent sets
- Generate all maximal independent sets in permutation graphs
- Efficient maximum matching algorithms for trapezoid graphs
Cites Work
- Title not available (Why is that?)
- A New Algorithm for Generating All the Maximal Independent Sets
- Trapezoid graphs and their coloring
- Dominations in trapezoid graphs
- On the 2-Chain Subgraph Cover and Related Problems
- Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs
- A sequential algorithm for finding a maximum weightK-independent set on interval graphs
- Recognizing circle graphs in polynomial time
- On the structure of trapezoid graphs
- Fast algorithms for generating all maximal independent sets of interval, circular-arc and chordal graphs
- Generate all maximal independent sets in permutation graphs
- Finding maximum cliques in circle graphs
- Efficient parallel algorithms for finding maximal cliques, clique trees, and minimum coloring on chordal graphs
- Fast Parallel Algorithms for Chordal Graphs
- A parallel algorithm to generate all maximal independent sets on permutation graphs
Cited In (8)
- Maximal independent sets in grid graphs
- A general method for generating all maximal independent sets of a graph
- An optimal PRAM algorithm for a spanning tree on trapezoid graphs.
- An Efficient Algorithm to Generate all Maximal Cliques on Trapezoid Graphs
- Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach
- Selection of programme slots of television channels for giving advertisement: a graph theoretic approach
- An efficient PRAM algorithm for maximum-weight independent set on permutation graphs
- Maximal independent sets in caterpillar graphs
This page was built for publication: An efficient algorithm to generate all maximal independent sets on trapezoid graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4240618)
