Algorithm 447

swMATH12877MaRDI QIDQ24801FDOQ24801

Author name not available (Why is that?)

Official website: http://dl.acm.org/citation.cfm?id=362272

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

• Recognizing a class of bicircular matroids
• Hint
• Push and rotate: a complete multi-agent pathfinding algorithm
• Detecting critical node structures on graphs: a mathematical programming approach
• Quick but odd growth of cacti
• 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 improved flow-based formulation and reduction principles for the minimum connectivity inference problem
• Producibility in hierarchical self-assembly
• On the (di)graphs with (directed) proper connection number two
• Acyclic k-connected subgraphs for distributed alternate routing in communications networks
• Efficient algorithms for updating betweenness centrality in fully dynamic graphs
• Algorithm to find a maximum 2-packing set in a cactus
• A two-level graph partitioning problem arising in mobile wireless communications
• The threshold probability for long cycles
• 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
• 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
• 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
• Global Data Flow Analysis and Iterative Algorithms
• A search strategy for the elementary cycles of a directed graph
• Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints
• C-planarity testing of embedded clustered graphs with bounded dual carving-width
• Title not available (Why is that?)
• Title not available (Why is that?)
• Cycle decompositions and constructive characterizations
• Parameterized algorithms for even cycle transversal
• Assembly planning by disjunctive programming and geometrical reasoning
• An algorithm for straight-line drawing of planar graphs
• Numerical Experiments with Iteration and Aggregation for Markov Chains
• The enumeration of generalized Tamari intervals
• Connectivity of workflow nets: The foundations of stepwise verification
• 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?)
• 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
• Finding cut-vertices in the square roots of a graph
• Planar rectilinear drawings of outerplanar graphs in linear time
• Efficient connection processing in equation-based object-oriented models
• The combinatorics of overlapping genes
• A polynomial kernel for block graph deletion
• Generation of trees of a graph with the use of decomposition
• Finding a maximum-weight convex set in a chordal graph
• 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
• Minimum size tree-decompositions
• Parameterized vertex deletion problems for hereditary graph classes with a block property
• A faster algorithm to recognize even-hole-free graphs
• Preprocessing for outerplanar vertex deletion: an elementary kernel of quartic size
• 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
• 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
• 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
• 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?)
• The recognition problem of graph search trees
• The tractability of CSP classes defined by forbidden patterns
• 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?)
• 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
• Polynomial-time classification of skew-symmetrizable matrices with a positive definite quasi-Cartan companion
• Validity of clusters formed by graph-theoretic cluster methods
• Influence of the tie-break rule on the end-vertex problem
• OGDF

This page was built for software: Algorithm 447