On atomic cliques in temporal graphs (Q6043101): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11590-023-01975-0 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Graph signatures: identification and optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5294075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique Relaxations in Social Network Analysis: The Maximum <i>k</i>-Plex Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Novel approaches for analyzing biological networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximum ratio clique relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A network-based data mining approach to portfolio selection via weighted clique relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for finding \(k\)-clubs in an undirected graph / 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: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Performance Profiles for Benchmarking Software / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding \(k\)-cliques in \(k\)-partite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case analysis of clique MIPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximum degree‐based ‐quasi‐clique problem: Complexity and exact approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum quasi-clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On clique relaxation models in network analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of computational methods in protein-protein interaction networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum ratio clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing maximal cliques in link streams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Why Is Maximum Clique Often Easy in Practice? / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11590-023-01975-0 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:55, 30 December 2024

scientific article; zbMATH DE number 7682171
Language Label Description Also known as
English
On atomic cliques in temporal graphs
scientific article; zbMATH DE number 7682171

    Statements

    On atomic cliques in temporal graphs (English)
    0 references
    0 references
    0 references
    0 references
    4 May 2023
    0 references
    clique
    0 references
    temporal graph
    0 references
    atomic
    0 references
    indivisible
    0 references
    unsplittable
    0 references

    Identifiers