Algorithm 447 - MaRDI portal

swMATH12877MaRDI QIDQ24801FDOQ24801

Author name not available (Why is that?)

Cited In (only showing first 100 items - show all)

Push and rotate: a complete multi-agent pathfinding algorithm
Quick but odd growth of cacti
Finding a Maximum-Weight Convex Set in a Chordal Graph
An improved flow-based formulation and reduction principles for the minimum connectivity inference problem
Producibility in hierarchical self-assembly
Towards interactive transition from AOC poset to concept lattice
On the (di)graphs with (directed) proper connection number two
NodeTrix planarity testing with small clusters
Parameterized Vertex Deletion Problems for Hereditary Graph Classes with a Block Property
Acyclic k-connected subgraphs for distributed alternate routing in communications networks
Title not available (Why is that?)
Parameterized Algorithms for Even Cycle Transversal
Service chain placement in SDNs
Algorithm to find a maximum 2-packing set in a cactus
A two-level graph partitioning problem arising in mobile wireless communications
Spatial interaction models with individual-level data for explaining labor flows and developing local labor markets
On a class of branching problems in broadcasting and distribution
Evaluating Relational Expressions with Dense and Sparse Arguments
A Parametric Analysis of a Constrained Nonlinear Inventory-production Model
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 new algorithm for digraph isomorphism
Linear expected-time algorithms for connectivity problems
Structure Detection in Mixed-Integer Programs
Substitutes, Complements and Ripples in Network Flows
Star-struck by fixed embeddings: modern crossing number heuristics
C-planarity testing of embedded clustered graphs with bounded dual carving-width
Title not available (Why is that?)
New results in two identical machines scheduling with agreement graphs
Cycle decompositions and constructive characterizations
Assembly planning by disjunctive programming and geometrical reasoning
Detecting critical node structures on graphs: A mathematical programming approach
Bayesian network marker selection via the thresholded graph Laplacian Gaussian prior
Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem
Numerical Experiments with Iteration and Aggregation for Markov Chains
The enumeration of generalized Tamari intervals
Computing subset transversals in \(H\)-free graphs
A simple algorithm for the planar multiway cut problem
Title not available (Why is that?)
Title not available (Why is that?)
The Price of Connectivity in Fair Division
Complexity of edge monitoring on some graph classes
Finding all minimum cost flows and a faster algorithm for the \(K\) best flow problem
Efficient reassembling of three-regular planar graphs
Estimating the number of connected components in sublinear time
On the equivalence of constrained and unconstrained flows
A branch and prune algorithm for the computation of generalized aspects of parallel robots
Efficient connection processing in equation-based object-oriented models
A polynomial kernel for block graph deletion
Compact drawings of 1-planar graphs with right-angle crossings and few bends
Title not available (Why is that?)
Algorithms for the Hypergraph and the Minor Crossing Number Problems
Almost envy-free allocations with connected bundles
Markov random field models for vector-based representations of landscapes
Computing Giant Graph Diameters
Minimum size tree-decompositions
A faster algorithm to recognize even-hole-free graphs
Preprocessing for outerplanar vertex deletion: an elementary kernel of quartic size
The Threshold Probability for Long Cycles
Recognizing a class of bicircular matroids
The subgraph homeomorphism problem
Many-sorted equivalence of shiny and strongly polite theories
Recognition of DFS trees: Sequential and parallel algorithms with refined verifications
Network Flow and Testing Graph Connectivity
Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs
The input/output complexity of transitive closure
On the spanning and routing ratios of the directed \(\varTheta_6\)-graph
Sequential stratified regeneration: \textit{MCMC} for large state spaces with an application to subgraph count estimation
An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset
Progress in presolving for mixed integer programming
Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints
Organizing the atoms of the clique separator decomposition into an atom tree
Title not available (Why is that?)
Mixed-integer programming techniques for the connected max-\(k\)-cut problem
Polynomial-time Classification of Skew-symmetrizable Matrices with a Positive Definite Quasi-Cartan Companion
Hybrid constructive heuristics for the critical node problem
Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds
On the existence of special depth first search trees
Optimal covering of cacti by vertex-disjoint paths
Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms
Efficient algorithms for updating betweenness centrality in fully dynamic graphs
Maintaining bridge-connected and biconnected components on-line
Graph operations on parity games and polynomial-time algorithms
Global optimization of nonconvex problems with multilinear intermediates
An Algorithm for Determining Whether the Connectivity of a Graph is at Leastk
Title not available (Why is that?)
On the recognition of search trees generated by BFS and DFS
A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph
Converting Linear Programs to Network Problems
A note on finding the bridges of a graph
Title not available (Why is that?)
Graphs That Do Not Contain a Cycle with a Node That Has at Least Two Neighbors on It
Efficient heuristic algorithm for identifying critical nodes in planar networks
A topological approach to dynamic graph connectivity
Recognizing graph search trees
Computing the rooted triplet distance between phylogenetic networks
A structure theorem for graphs with no cycle with a unique chord and its consequences
A bootstrap heuristic for designing minimum cost survivable networks
A single-exponential FPT algorithm for the \(K_4\)-\textsc{minor cover} problem
Network verification via routing table queries

This page was built for software: Algorithm 447