A new backtracking algorithm for generating the family of maximal independent sets of a graph
From MaRDI portal
Publication:786833
DOI10.1016/0898-1221(83)90115-3zbMATH Open0528.05058OpenAlexW2052864165MaRDI QIDQ786833FDOQ786833
Authors: Emmanuel Loukakis 
Publication date: 1983
Published in: Computers & Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0898-1221(83)90115-3
Graph theory (including graph drawing) in computer science (68R10) Graph theory (05C99) Algorithms in computer science (68W99)
Cites Work
- Algorithm 457: finding all cliques of an undirected graph
- Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
- A New Algorithm for Generating All the Maximal Independent Sets
- On cliques in graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Enumeration of Maximal Cliques of Large Graphs
- Title not available (Why is that?)
- A note on the complexity of the chromatic number problem
- An algorithm for the chromatic number of a graph
- An Analysis of Some Graph Theoretical Cluster Techniques
- Corrections to Bierstone's Algorithm for Generating Cliques
- A depth first search algorithm to generate the family of maximal independent sets of a graph lexicographically
- Clique detection for nondirected graphs: Two new algorithms
- An Algorithm for the Chromatic Number of a Graph
- Clique Detection Algorithms Based on Line Addition and Line Removal
Cited In (5)
Uses Software
This page was built for publication: A new backtracking algorithm for generating the family of maximal independent sets of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q786833)
