On Fault-Tolerant Low-Diameter Clusters in Graphs
From MaRDI portal
Publication:5060794
DOI10.1287/ijoc.2022.1231OpenAlexW4296230289MaRDI QIDQ5060794
Hosseinali Salemi, Yajun Lu, Balabhaskar Balasundaram, Austin Buchanan
Publication date: 11 January 2023
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2022.1231
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the hop-constrained survivable network design problem with reliable edges
- Finding clubs in graph classes
- Identifying large robust network clusters via new compact formulations of maximum \(k\)-club problems
- On inclusionwise maximal and maximum cardinality \(k\)-clubs in graphs
- Finding large \(k\)-clubs in undirected graphs
- The node-deletion problem for hereditary properties is NP-complete
- Using separation algorithms to generate mixed integer model reformulations
- k-Blocks and Ultrablocks in Graphs
- Mengerian theorems for paths of bounded length
- Geometric algorithms and combinatorial optimization.
- An exact algorithm for the maximum \(k\)-club problem in an undirected graph
- Compact vs. exponential-size LP relaxations
- Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts
- Correction to: ``Finding a maximum \(k\)-club using the \(k\)-clique formulation and canonical hypercube cuts
- Optimal approximation algorithms for maximum distance-bounded subgraph problems
- On imposing connectivity constraints in integer programs
- On biconnected and fragile subgraphs of low diameter
- Design of survivable networks with vulnerability constraints
- Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments
- Parameterized computational complexity of finding small-diameter subgraphs
- Heuristics for finding \(k\)-clubs in an undirected graph
- Parsimonious formulations for low-diameter clusters
- On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs
- On clique relaxation models in network analysis
- An analytical comparison of the LP relaxations of integer models for the \(k\)-club problem
- On structural parameterizations for the 2-club problem
- Solving the maximum clique problem using a tabu search approach
- Fast algorithms for determining (generalized) core groups in social networks
- Novel approaches for analyzing biological networks
- Length-bounded cuts and flows
- Maximal Flow Through a Network
- Mining Graph Data
- Approximating Maximum Diameter-Bounded Subgraphs
- Smallest-last ordering and clustering and graph coloring algorithms
- Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints
- A graph‐theoretic definition of a sociometric clique†
- Algorithmic Aspects of Vertex Elimination on Graphs
- The complexity of finding maximum disjoint paths with length constraints
- Graph Partitioning and Graph Clustering
- Why Is Maximum Clique Often Easy in Practice?
- Imposing Connectivity Constraints in Forest Planning Models
- $k$-Blocks: A Connectivity Invariant for Graphs
- A Note on Performance Profiles for Benchmarking Software
- Property Pd,m and efficient design of reliable networks
- Collective dynamics of ‘small-world’ networks
- Heuristic initialization for bipartite matching problems
- Power balance and apportionment algorithms for the United States Congress
- Benchmarking optimization software with performance profiles.
This page was built for publication: On Fault-Tolerant Low-Diameter Clusters in Graphs
