On Fault-Tolerant Low-Diameter Clusters in Graphs (Q5060794): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A graph‐theoretic definition of a sociometric clique† / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analytical comparison of the LP relaxations of integer models for the \(k\)-club problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Maximum Diameter-Bounded Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal approximation algorithms for maximum distance-bounded subgraph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Partitioning and Graph Clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Length-bounded cuts and flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Novel approaches for analyzing biological networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for determining (generalized) core groups in social networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hop-constrained survivable network design problem with reliable edges / 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: An exact algorithm for the maximum \(k\)-club problem in an undirected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3918145 / rank
 
Normal rank
Property / cites work
 
Property / cites work: $k$-Blocks: A Connectivity Invariant for Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact vs. exponential-size LP relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Imposing Connectivity Constraints in Forest Planning Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding large \(k\)-clubs in undirected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mining Graph Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Property <i>P</i><sub><i>d</i>,<i>m</i></sub> and efficient design of reliable networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Flow Through a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the maximum clique problem using a tabu search approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding clubs in graph classes / 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: Design of survivable networks with vulnerability constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On structural parameterizations for the 2-club problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of finding maximum disjoint paths with length constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic initialization for bipartite matching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The node-deletion problem for hereditary properties is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mengerian theorems for paths of bounded length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correction to: ``Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power balance and apportionment algorithms for the United States Congress / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using separation algorithms to generate mixed integer model reformulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: k-Blocks and Ultrablocks in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smallest-last ordering and clustering and graph coloring algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs / 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: Algorithmic Aspects of Vertex Elimination on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parsimonious formulations for low-diameter clusters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized computational complexity of finding small-diameter subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5345644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Why Is Maximum Clique Often Easy in Practice? / rank
 
Normal rank
Property / cites work
 
Property / cites work: On imposing connectivity constraints in integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collective dynamics of ‘small-world’ networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On biconnected and fragile subgraphs of low diameter / rank
 
Normal rank

Revision as of 06:40, 31 July 2024

scientific article; zbMATH DE number 7640788
Language Label Description Also known as
English
On Fault-Tolerant Low-Diameter Clusters in Graphs
scientific article; zbMATH DE number 7640788

    Statements

    On Fault-Tolerant Low-Diameter Clusters in Graphs (English)
    0 references
    0 references
    0 references
    0 references
    11 January 2023
    0 references
    integer programming
    0 references
    hereditary \(s\)-clubs
    0 references
    robust \(s\)-clubs
    0 references
    branch-and-cut
    0 references
    social network analysis
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers