Solving maximum clique in sparse graphs: an \({O(nm+n2^{d/4})}\) algorithm for \(d\)-degenerate graphs (Q479213): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Normalize DOI.
 
(8 intermediate revisions by 7 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11590-013-0698-2 / rank
Normal rank
 
Property / author
 
Property / author: Sergiy I. Butenko / rank
Normal rank
 
Property / author
 
Property / author: Sergiy I. Butenko / 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.1007/s11590-013-0698-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W80045804 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Partitioning and Graph Clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Number of cliques in random scale-free network ensembles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for max independent set / 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: Q5747946 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>k</i>-Degenerate Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smallest-last ordering and clustering and graph coloring algorithms / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11590-013-0698-2 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:48, 9 December 2024

scientific article
Language Label Description Also known as
English
Solving maximum clique in sparse graphs: an \({O(nm+n2^{d/4})}\) algorithm for \(d\)-degenerate graphs
scientific article

    Statements

    Solving maximum clique in sparse graphs: an \({O(nm+n2^{d/4})}\) algorithm for \(d\)-degenerate graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 December 2014
    0 references
    maximum clique
    0 references
    degeneracy
    0 references
    sparse graphs
    0 references
    fixed-parameter
    0 references
    tractability
    0 references
    \(d\)-degenerate graphs
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references