Efficiently covering complex networks with cliques of similar vertices (Q2368963): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q175601
ReferenceBot (talk | contribs)
Changed an Item
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Anusch Taraz / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: COSMOS / 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.2005.12.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1968481794 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Component evolution in random intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Models of Random Intersection Graphs and their Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite structure of all complex networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4519896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Random Intersection Graphs: The Subgraph Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vertex degree distribution of random intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring Random Intersection Graphs and Complex Networks / rank
 
Normal rank

Revision as of 12:11, 24 June 2024

scientific article
Language Label Description Also known as
English
Efficiently covering complex networks with cliques of similar vertices
scientific article

    Statements

    Identifiers

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