A depth first search algorithm to generate the family of maximal independent sets of a graph lexicographically (Q1157909): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Emmanuel Loukakis / rank
Normal rank
 
Property / author
 
Property / author: Constantine Tsouros / rank
Normal rank
 
Property / author
 
Property / author: Emmanuel Loukakis / rank
 
Normal rank
Property / author
 
Property / author: Constantine Tsouros / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Algorithm 457 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Some Graph Theoretical Cluster Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 457: finding all cliques of an undirected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique detection for nondirected graphs: Two new algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum internally stable sets of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cliques in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Corrections to Bierstone's Algorithm for Generating Cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for Generating All the Maximal Independent Sets / rank
 
Normal rank

Latest revision as of 14:12, 13 June 2024

scientific article
Language Label Description Also known as
English
A depth first search algorithm to generate the family of maximal independent sets of a graph lexicographically
scientific article

    Statements