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)

• 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
• 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
• MAX-2-SAT
• OGDF
• PBGL
• GDToolkit
• Blossom V
• Switching 3-edge-colorings of cubic graphs
• Linear algorithms on recursive representations of trees
• EPoS
• ScreenClean
• Semigroups
• JUNG
• LUMOD
• BMSS
• SANET
• NodeTrix
• Simplicial complex library
• LARLIB
• APT
• SystemModeler
• BZTreewidth
• Algorithm 457
• GenerateUHG
• FCALGS
• Kavosh
• PhyloNetworks
• MosaicFinder
• spatstat.Knet
• FRAGSTATS
• k-Vertex-Cut-Problem
• AS 266
• tcp_package
• tqDist
• Higher Order Voronoi Diagrams of Segments for VLSI Critical Area Extraction
• Optimality of Graphlet Screening in High Dimensional Variable Selection
• TriLoNet
• Fourier acceleration of iterative processes in disordered systems.
• Bezout
• SuMoTED
• vnep-approx
• Tree search and quantum computation
• On a Class of Totally Unimodular Matrices
• On the role of expander graphs in key predistribution schemes for wireless sensor networks
• \(k\)-chordal graphs: from cops and robber to compact routing via treewidth
• Real-time scheduling with resource sharing on heterogeneous multiprocessors
• Joint optimization of level of repair analysis and spare parts stocks
• A new algorithm for the minimum spanning tree verification problem
• Efficiently searching a graph by a smell-oriented vertex process
• Toward Optimality in Discrete Morse Theory
• Graphs that do not contain a cycle with a node that has at least two neighbors on it
• Roots of unity in orders
• A linear-time algorithm for finding a one-to-many 3-disjoint path cover in the cube of a connected graph
• Cyber Detectives: Determining When Robots or People Misbehave
• Symbolic graphs: Linear solutions to connectivity related problems
• Edge-colouring and total-colouring chordless graphs
• Cyclability in graph classes
• On Algorithms for Enumerating All Circuits of a Graph
• 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
• 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

This page was built for software: Algorithm 447