On detecting maximal quasi antagonistic communities in signed graphs (Q1741135): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: GenLouvain / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2095264893 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3044359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph‐theoretic definition of a sociometric clique† / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-core decomposition of internet graphs: hierarchies, self-similarity and measurement biases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correlation clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast unfolding of communities in large networks / 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: Detecting network communities: a new systematic and efficient algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph theoretic blockings k‐plexes and k‐cutpoints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Biclique graphs and biclique matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generating all maximal independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-bicliques: Complexity and Binding Pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cliques in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Community Structure in Time-Dependent, Multiscale, and Multiplex Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:03, 19 July 2024

scientific article
Language Label Description Also known as
English
On detecting maximal quasi antagonistic communities in signed graphs
scientific article

    Statements

    On detecting maximal quasi antagonistic communities in signed graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    3 May 2019
    0 references
    signed graph
    0 references
    bi-clique
    0 references
    quasi antagonistic community
    0 references
    enumeration tree
    0 references
    power law distribution
    0 references

    Identifiers