Algorithm 447

swMATH12877MaRDI QIDQ24801

No author found.

Related Items (only showing first 100 items - show all)

Substitutes, Complements and Ripples in Network Flows ⋮ Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics ⋮ Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel ⋮ Unnamed Item ⋮ Parameterized Vertex Deletion Problems for Hereditary Graph Classes with a Block Property ⋮ On Fault-Tolerant Low-Diameter Clusters in Graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Digraphs and Variable Degeneracy ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Toward Optimality in Discrete Morse Theory ⋮ Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints ⋮ Simultaneously dominating all spanning trees of a graph ⋮ A Parametric Analysis of a Constrained Nonlinear Inventory-production Model ⋮ Unnamed Item ⋮ On the existence of special depth first search trees ⋮ Hitting Selected (Odd) Cycles ⋮ Numerical Experiments with Iteration and Aggregation for Markov Chains ⋮ Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem ⋮ The maximal subgroups and the complexity of the flow semigroup of finite (di)graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The Threshold Probability for Long Cycles ⋮ Algorithms from THE BOOK ⋮ An Algorithm for Determining Whether the Connectivity of a Graph is at Leastk ⋮ Algorithms for the Hypergraph and the Minor Crossing Number Problems ⋮ Structure Detection in Mixed-Integer Programs ⋮ Detecting critical node structures on graphs: A mathematical programming approach ⋮ Higher Order Voronoi Diagrams of Segments for VLSI Critical Area Extraction ⋮ Global Data Flow Analysis and Iterative Algorithms ⋮ The enumeration of generalized Tamari intervals ⋮ Network Flow and Testing Graph Connectivity ⋮ A search strategy for the elementary cycles of a directed graph ⋮ On Algorithms for Enumerating All Circuits of a Graph ⋮ An enumeration algorithm for combinatorial problems of the reliability analysis of binary coherent systems ⋮ Minimum size tree-decompositions ⋮ Polynomial-time Classification of Skew-symmetrizable Matrices with a Positive Definite Quasi-Cartan Companion ⋮ Graphs That Do Not Contain a Cycle with a Node That Has at Least Two Neighbors on It ⋮ Evaluating Relational Expressions with Dense and Sparse Arguments ⋮ A new algorithm for digraph isomorphism ⋮ A structure theorem for graphs with no cycle with a unique chord and its consequences ⋮ Finding cut-vertices in the square roots of a graph ⋮ Compact drawings of 1-planar graphs with right-angle crossings and few bends ⋮ An improved flow-based formulation and reduction principles for the minimum connectivity inference problem ⋮ Parameterized Algorithms for Even Cycle Transversal ⋮ Computing the rooted triplet distance between phylogenetic networks ⋮ Computing subset transversals in \(H\)-free graphs ⋮ Converting Linear Programs to Network Problems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the (di)graphs with (directed) proper connection number two ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Finding Detours is Fixed-Parameter Tractable ⋮ An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset ⋮ Linear expected-time algorithms for connectivity problems ⋮ Kernelization of Graph Hamiltonicity: Proper $H$-Graphs ⋮ Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms ⋮ A matheuristic approach for solving the 2-connected dominating set problem ⋮ Efficient Local Search based on Dynamic Connectivity Maintenance for Minimum Connected Dominating Set ⋮ Faster algorithms for shortest path and network flow based on graph decomposition ⋮ Schematic Representation of Large Biconnected Graphs ⋮ The Recognition Problem of Graph Search Trees ⋮ Finding a Maximum-Weight Convex Set in a Chordal Graph ⋮ Cycle decompositions and constructive characterizations ⋮ Robust Hierarchical Clustering for Directed Networks: An Axiomatic Approach ⋮ On a Class of Totally Unimodular Matrices ⋮ The Price of Connectivity in Fair Division ⋮ The Tractability of CSP Classes Defined by Forbidden Patterns ⋮ Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis ⋮ An algorithm for observability determination in water-system state estimation ⋮ Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs ⋮ Hybrid constructive heuristics for the critical node problem ⋮ Planar rectilinear drawings of outerplanar graphs in linear time ⋮ Spatial interaction models with individual-level data for explaining labor flows and developing local labor markets ⋮ Roots of unity in orders ⋮ Recognizing a class of bicircular matroids ⋮ Sequential stratified regeneration: \textit{MCMC} for large state spaces with an application to subgraph count estimation ⋮ On the spanning and routing ratios of the directed \(\varTheta_6\)-graph ⋮ Cyclability in graph classes ⋮ Real-time monitoring of undirected networks: Articulation points, bridges, and connected and biconnected components ⋮ Recognizing graph search trees ⋮ On the equivalence of constrained and unconstrained flows ⋮ Unnamed Item ⋮ A linear-time algorithm for finding a one-to-many 3-disjoint path cover in the cube of a connected graph ⋮ 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 ⋮ Switching 3-edge-colorings of cubic graphs ⋮ Star-struck by fixed embeddings: modern crossing number heuristics ⋮ Graph Theory with Algorithms and its Applications ⋮ The input/output complexity of transitive closure ⋮ A topological approach to dynamic graph connectivity ⋮ On the Role of Expander Graphs in Key Predistribution Schemes for Wireless Sensor Networks ⋮ Acyclic k-connected subgraphs for distributed alternate routing in communications networks ⋮ Push and Rotate: a Complete Multi-agent Pathfinding Algorithm ⋮ A heuristic approach for dividing graphs into bi-connected components with a size constraint ⋮ Complexity of edge monitoring on some graph classes ⋮ Finding all minimum cost flows and a faster algorithm for the \(K\) best flow problem ⋮ A bootstrap heuristic for designing minimum cost survivable networks

This page was built for software: Algorithm 447