Refined pivot selection for maximal clique enumeration in graphs (Q899307): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2015.11.016 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2015.11.016 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2180361393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-detection models in computational biochemistry and genomics / 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: Enumerating all connected maximal common subgraphs in two graphs / 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
Property / cites work
 
Property / cites work: An algorithm for reporting maximal \(c\)-cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the problem of reporting maximal cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cliques in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mersenne twister / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3267900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2015.11.016 / rank
 
Normal rank

Latest revision as of 07:47, 10 December 2024

scientific article
Language Label Description Also known as
English
Refined pivot selection for maximal clique enumeration in graphs
scientific article

    Statements

    Identifiers