Algorithm 447
From MaRDI portal
Cited in
(only showing first 100 items - show all)- A topological approach to dynamic graph connectivity
- Acyclic k-connected subgraphs for distributed alternate routing in communications networks
- The subgraph homeomorphism problem
- Optimal covering of cacti by vertex-disjoint paths
- Maintaining bridge-connected and biconnected components on-line
- Validity of clusters formed by graph-theoretic cluster methods
- Linear algorithms on recursive representations of trees
- Efficiently searching a graph by a smell-oriented vertex process
- On the equivalence of constrained and unconstrained flows
- The input/output complexity of transitive closure
- An algorithm for straight-line drawing of planar graphs
- MAX-2-SAT
- A linear-time algorithm for finding a one-to-many 3-disjoint path cover in the cube of a connected graph
- OGDF
- PBGL
- GDToolkit
- Blossom V
- Efficient heuristic algorithm for identifying critical nodes in planar networks
- A two-level graph partitioning problem arising in mobile wireless communications
- Algorithm to find a maximum 2-packing set in a cactus
- Efficient algorithms for updating betweenness centrality in fully dynamic graphs
- On a class of branching problems in broadcasting and distribution
- A note on finding the bridges of a graph
- A bootstrap heuristic for designing minimum cost survivable networks
- Joint optimization of level of repair analysis and spare parts stocks
- Fourier acceleration of iterative processes in disordered systems.
- Producibility in hierarchical self-assembly
- The combinatorics of overlapping genes
- EPoS
- C-planarity testing of embedded clustered graphs with bounded dual carving-width
- Efficient connection processing in equation-based object-oriented models
- Almost envy-free allocations with connected bundles
- Markov random field models for vector-based representations of landscapes
- On the recognition of search trees generated by BFS and DFS
- Preprocessing for outerplanar vertex deletion: an elementary kernel of quartic size
- Towards interactive transition from AOC poset to concept lattice
- Planar rectilinear drawings of outerplanar graphs in linear time
- Recognizing graph search trees
- Criterion for a graph to admit a good orientation in terms of leaf blocks
- On the spanning and routing ratios of the directed _6-graph
- Switching 3-edge-colorings of cubic graphs
- Star-struck by fixed embeddings: modern crossing number heuristics
- 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
- Mixed-integer programming techniques for the connected max-\(k\)-cut problem
- Real-time scheduling with resource sharing on heterogeneous multiprocessors
- Estimating the number of connected components in sublinear time
- ScreenClean
- Robustness: a new form of heredity motivated by dynamic networks
- Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints
- Bayesian network marker selection via the thresholded graph Laplacian Gaussian prior
- Permanent, determinant, and rank of bi-block graphs
- Structural aspects of semigroups based on digraphs
- Service chain placement in SDNs
- Finding, hitting and packing cycles in subexponential time on unit disk graphs
- A new algorithm for the minimum spanning tree verification problem
- Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds
- Finding disjoint paths in networks with star shared risk link groups
- A faster algorithm to recognize even-hole-free graphs
- Global optimization of nonconvex problems with multilinear intermediates
- 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
- Semigroups
- A heuristic approach for dividing graphs into bi-connected components with a size constraint
- JUNG
- A polynomial kernel for block graph deletion
- Quick but odd growth of cacti
- New results in two identical machines scheduling with agreement graphs
- A branch and prune algorithm for the computation of generalized aspects of parallel robots
- LUMOD
- Symbolic graphs: Linear solutions to connectivity related problems
- Distribution of statistics of hidden state sequences through the sum-product algorithm
- BMSS
- Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs
- Assembly planning by disjunctive programming and geometrical reasoning
- Graphical modeling of stochastic processes driven by correlated noise
- SANET
- scientific article; zbMATH DE number 1566497 (Why is no real title available?)
- Hybrid constructive heuristics for the critical node problem
- A simple algorithm for the planar multiway cut problem
- Computing giant graph diameters
- 3-colored triangulation of 2D maps
- Real-time monitoring of undirected networks: articulation points, bridges, and connected and biconnected components
- Graph theory with algorithms and its applications. In applied science and technology
- On the role of expander graphs in key predistribution schemes for wireless sensor networks
- Influence of the tie-break rule on the end-vertex problem
- Push and rotate: a complete multi-agent pathfinding algorithm
- Optimality of Graphlet Screening in High Dimensional Variable Selection
- Optimal Data Structures for Farthest-Point Queries in Cactus Networks
- Cyber Detectives: Determining When Robots or People Misbehave
- scientific article; zbMATH DE number 4016186 (Why is no real title available?)
- Finding a maximum-weight convex set in a chordal graph
- NodeTrix
- The tractability of CSP classes defined by forbidden patterns
- Parameterized vertex deletion problems for hereditary graph classes with a block property
- Simplicial complex library
- LARLIB
- SystemModeler
This page was built for software: Algorithm 447
