Large-scale clique cover of real-world networks (Q2288213): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ic.2019.104464 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: Algorithm 457 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SNAP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: KronFit / 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.ic.2019.104464 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2971677828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for compact letter displays: comparison and evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiently covering complex networks with cliques of similar vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite structure of all complex networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Can visibility graphs be represented compactly? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding all maximal cliques in dynamic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical analysis of financial networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing an indeterminate string from its associated graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering edges by cliques with regard to keyword conflicts and intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138414 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Known Algorithms for Edge Clique Cover are Probably Optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4152571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4448745 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4016827 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time algorithms on circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4014438 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data reduction and exact algorithms for clique cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of approximating minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945528 / 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: Data Reduction, Exact, and Heuristic Algorithms for Clique Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Representation of a Graph by Set Intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assignment-minimum clique coverings / 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: The worst-case time complexity for generating all maximal cliques and computational experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4598291 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3291948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2896064 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.IC.2019.104464 / rank
 
Normal rank

Latest revision as of 20:19, 17 December 2024

scientific article
Language Label Description Also known as
English
Large-scale clique cover of real-world networks
scientific article

    Statements

    Large-scale clique cover of real-world networks (English)
    0 references
    0 references
    0 references
    0 references
    17 January 2020
    0 references
    edge clique cover
    0 references
    network analysis
    0 references
    graph algorithms
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references