A heuristic approach for dividing graphs into bi-connected components with a size constraint
From MaRDI portal
Publication:2403269
DOI10.1007/s10732-017-9331-3zbMath1370.90300arXiv1604.04829OpenAlexW2340884923MaRDI QIDQ2403269
Tatsushi Nishi, Raka Jovanovic, Stefan Voß
Publication date: 8 September 2017
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1604.04829
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Uses Software
Cites Work
- A heuristic method for solving the problem of partitioning graphs with supply and demand
- Power optimization in ad hoc wireless network topology control with biconnectivity requirements
- A mixed integer program for partitioning graphs with supply and demand emphasizing sparse graphs
- A space-efficient algorithm for finding strongly connected components
- Variable neighbourhood search: methods and applications
- Satisfactory graph partition, variants, and generalizations
- Approximability of partitioning graphs with supply and demand
- Algorithms for connected set cover problem and fault-tolerant connected set cover problem
- On finding a biconnected spanning planar subgraph with applications to the facilities layout problem
- Two algorithms for minimum 2-connected \(r\)-hop dominating set
- Why should biconnected components be identified first
- Greedy randomized adaptive search procedures
- Minimum cost partitions of trees with supply and demand
- A simple test on 2-vertex- and 2-edge-connectivity
- Continuous graph partitioning for camera network surveillance
- Ant colony optimization theory: a survey
- An Integer Programming Approach for Fault-Tolerant Connected Dominating Sets
- The generalized minimum edge-biconnected network problem: Efficient neighborhood structures for variable neighborhood search
- Dividing a Graph into Triconnected Components
- Modelling the Power Supply Network – Hardness and Approximation
- Parametric Power Supply Networks
- Depth-First Search and Linear Graph Algorithms
- A Theorem on Graphs, with an Application to a Problem of Traffic Control
