A note on the problem of reporting maximal cliques (Q955035): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Frédéric Cazals / rank
Normal rank
 
Property / author
 
Property / author: Frédéric Cazals / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q56210397 / 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2008.05.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1974959172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Enumeration of Maximal Cliques of Large Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145799 / 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: An algorithm for reporting maximal \(c\)-cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating all connected maximal common subgraphs in two graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cliques in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm Theory - SWAT 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for Generating All the Maximal Independent Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The worst-case time complexity for generating all maximal cliques and computational experiments / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:33, 28 June 2024

scientific article
Language Label Description Also known as
English
A note on the problem of reporting maximal cliques
scientific article

    Statements

    A note on the problem of reporting maximal cliques (English)
    0 references
    0 references
    0 references
    18 November 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    maximal cliques
    0 references
    output sensitive algorithms
    0 references
    maximal common subgraphs
    0 references
    enumeration problems
    0 references
    0 references
    0 references