Maximum matchings in scale-free networks with identical degree distribution (Q528496): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5515866 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of Perfect Matchings in Chemistry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Controllability and matchings in random bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938474 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Enumeration and Reliability Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the theory of Pfaffian orientations. I: Perfect matchings and permanents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4370201 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new NC-algorithm for finding a perfect matching in bipartite planar and small genus graphs (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unique Maximum Matching Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized domino-shuffling. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Number of maximum matchings of bipartite graphs with positive surplus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of graphical condensation for enumerating matchings and tilings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphical condensation of plane graphs: a combinatorial approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphical condensation for enumerating perfect matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of perfect matchings of a type of Cartesian products of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dimers and amoebae / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of matchings in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quadratic identity for the number of perfect matchings of plane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and asymptotic enumeration of perfect matchings in self-similar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a maximum matching in a sparse random graph in <i>O</i> ( <i>n</i> ) expected time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting dimer coverings on self-similar Schreier graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching in multi-interface networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching in regular and almost regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Structure and Function of Complex Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Emergence of Scaling in Random Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The statistics of dimers on a lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dimer problem in statistical mechanics-an exact result / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing numbers of Sierpiński‐like graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collective dynamics of ‘small-world’ networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Farey graphs as models for complex networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A box-covering algorithm for fractal scaling in scale-free networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of perfect matchings of line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local characteristics, entropy and limit theorems for spanning trees and domino tilings via transfer-impedances / rank
 
Normal rank
Property / cites work
 
Property / cites work: DIMERS ON TWO-DIMENSIONAL LATTICES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverted Berezinskii-Kosterlitz-Thouless singularity and high-temperature algebraic order in an Ising model on a scale-free hierarchical-lattice small-world network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pfaffian orientation and enumeration of perfect matchings for some Cartesian products of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Tower of Hanoi – Myths and Maths / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number and degree distribution of spanning trees in the Tower of Hanoi graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural properties of subdivided-line graphs / rank
 
Normal rank

Revision as of 18:59, 13 July 2024

scientific article
Language Label Description Also known as
English
Maximum matchings in scale-free networks with identical degree distribution
scientific article

    Statements

    Maximum matchings in scale-free networks with identical degree distribution (English)
    0 references
    12 May 2017
    0 references
    maximum matching
    0 references
    perfect matching
    0 references
    Pfaffian orientation
    0 references
    scale-free network
    0 references
    complex network
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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