Cited in
(only showing first 100 items - show all)- Hitting selected (odd) cycles
- The price of connectivity in fair division
- Graph theory with algorithms and its applications. In applied science and technology
- Preprocessing for outerplanar vertex deletion: an elementary kernel of quartic size
- Simultaneously dominating all spanning trees of a graph
- Cyclability in graph classes
- On Algorithms for Enumerating All Circuits of a Graph
- The subgraph homeomorphism problem
- Recognizing a class of bicircular matroids
- Many-sorted equivalence of shiny and strongly polite theories
- Recognition of DFS trees: Sequential and parallel algorithms with refined verifications
- Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs
- Push and rotate: a complete multi-agent pathfinding algorithm
- Quick but odd growth of cacti
- On the spanning and routing ratios of the directed _6-graph
- Sequential stratified regeneration: \textit{MCMC} for large state spaces with an application to subgraph count estimation
- The input/output complexity of transitive closure
- Network Flow and Testing Graph Connectivity
- Detecting critical node structures on graphs: a mathematical programming approach
- Progress in presolving for mixed integer programming
- Structural aspects of semigroups based on digraphs
- Real-time monitoring of undirected networks: articulation points, bridges, and connected and biconnected components
- An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset
- Organizing the atoms of the clique separator decomposition into an atom tree
- Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints
- Hybrid constructive heuristics for the critical node problem
- scientific article; zbMATH DE number 1566497 (Why is no real title available?)
- Mixed-integer programming techniques for the connected max-\(k\)-cut problem
- Finding, hitting and packing cycles in subexponential time on unit disk graphs
- An enumeration algorithm for combinatorial problems of the reliability analysis of binary coherent systems
- An improved flow-based formulation and reduction principles for the minimum connectivity inference problem
- Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds
- Producibility in hierarchical self-assembly
- Optimal covering of cacti by vertex-disjoint paths
- Towards interactive transition from AOC poset to concept lattice
- On the existence of special depth first search trees
- Robust Hierarchical Clustering for Directed Networks: An Axiomatic Approach
- On the (di)graphs with (directed) proper connection number two
- Acyclic k-connected subgraphs for distributed alternate routing in communications networks
- Digraphs and variable degeneracy
- Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms
- Service chain placement in SDNs
- Finding disjoint paths in networks with star shared risk link groups
- Efficient algorithms for updating betweenness centrality in fully dynamic graphs
- Maintaining bridge-connected and biconnected components on-line
- Algorithm to find a maximum 2-packing set in a cactus
- Graph operations on parity games and polynomial-time algorithms
- scientific article; zbMATH DE number 4016186 (Why is no real title available?)
- Global optimization of nonconvex problems with multilinear intermediates
- A two-level graph partitioning problem arising in mobile wireless communications
- Algorithms from THE BOOK
- An Algorithm for Determining Whether the Connectivity of a Graph is at Leastk
- scientific article; zbMATH DE number 3560709 (Why is no real title available?)
- A matheuristic approach for solving the 2-connected dominating set problem
- Spatial interaction models with individual-level data for explaining labor flows and developing local labor markets
- The recognition problem of graph search trees
- The threshold probability for long cycles
- On a class of branching problems in broadcasting and distribution
- On the recognition of search trees generated by BFS and DFS
- The tractability of CSP classes defined by forbidden patterns
- A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph
- One-way trail orientations
- Evaluating Relational Expressions with Dense and Sparse Arguments
- Criterion for a graph to admit a good orientation in terms of leaf blocks
- On the spanning and routing ratios of the directed \(\Theta_6\)-graph
- A note on finding the bridges of a graph
- A Parametric Analysis of a Constrained Nonlinear Inventory-production Model
- Converting Linear Programs to Network Problems
- A new algorithm for digraph isomorphism
- scientific article; zbMATH DE number 1424145 (Why is no real title available?)
- Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics
- Efficient heuristic algorithm for identifying critical nodes in planar networks
- Linear expected-time algorithms for connectivity problems
- An algorithm for observability determination in water-system state estimation
- A topological approach to dynamic graph connectivity
- Structure Detection in Mixed-Integer Programs
- Substitutes, Complements and Ripples in Network Flows
- Recognizing graph search trees
- Faster algorithms for shortest path and network flow based on graph decomposition
- A bootstrap heuristic for designing minimum cost survivable networks
- MAX-2-SAT
- OGDF
- PBGL
- GDToolkit
- Blossom V
- EPoS
- ScreenClean
- Semigroups
- JUNG
- LUMOD
- BMSS
- SANET
- The maximal subgroups and the complexity of the flow semigroup of finite (di)graphs
- A single-exponential FPT algorithm for the \(K_4\)-\textsc{minor cover} problem
- Network verification via routing table queries
- 2-connecting outerplanar graphs without blowing up the pathwidth
- NodeTrix
- Simplicial complex library
- LARLIB
- APT
This page was built for software: Algorithm 447
