Compact structure for sparse undirected graphs based on a clique graph partition (Q2054100): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ins.2020.09.010 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: WebGraph / 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.ins.2020.09.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3087053539 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm Theory - SWAT 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Listing All Maximal Cliques in Large Sparse Real-World Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended Compact Web Graph Representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Compression of Web Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph compression by BFS / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial characterization of clique graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of clique graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Method for the Construction of Minimum-Redundancy Codes / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.INS.2020.09.010 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:55, 16 December 2024

scientific article
Language Label Description Also known as
English
Compact structure for sparse undirected graphs based on a clique graph partition
scientific article

    Statements

    Compact structure for sparse undirected graphs based on a clique graph partition (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    30 November 2021
    0 references
    graph compression
    0 references
    clustering
    0 references
    compact data structures
    0 references
    network analysis
    0 references
    maximal cliques
    0 references

    Identifiers

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