The following pages link to Algorithm 447 (Q24801):
Displaying 50 items.
- Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs (Q266794) (← links)
- Hybrid constructive heuristics for the critical node problem (Q271993) (← links)
- Edge-colouring and total-colouring chordless graphs (Q389214) (← links)
- Organizing the atoms of the clique separator decomposition into an atom tree (Q406311) (← links)
- \(k\)-chordal graphs: from cops and robber to compact routing via treewidth (Q494802) (← links)
- Tree search and quantum computation (Q638594) (← links)
- Many-sorted equivalence of shiny and strongly polite theories (Q682380) (← links)
- Recognition of DFS trees: Sequential and parallel algorithms with refined verifications (Q685690) (← links)
- A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph (Q730490) (← links)
- Turing kernelization for finding long paths and cycles in restricted graph classes (Q730497) (← links)
- A single-exponential FPT algorithm for the \(K_4\)-\textsc{minor cover} problem (Q743120) (← links)
- Network verification via routing table queries (Q743125) (← links)
- 2-connecting outerplanar graphs without blowing up the pathwidth (Q744095) (← links)
- Connectivity of workflow nets: The foundations of stepwise verification (Q766173) (← links)
- Generation of trees of a graph with the use of decomposition (Q800368) (← links)
- Sequential stratified regeneration: \textit{MCMC} for large state spaces with an application to subgraph count estimation (Q832666) (← links)
- On the spanning and routing ratios of the directed \(\varTheta_6\)-graph (Q832828) (← links)
- Cyclability in graph classes (Q833007) (← links)
- Progress in presolving for mixed integer programming (Q903920) (← links)
- Graph operations on parity games and polynomial-time algorithms (Q906273) (← links)
- A topological approach to dynamic graph connectivity (Q1108030) (← links)
- Acyclic k-connected subgraphs for distributed alternate routing in communications networks (Q1115406) (← links)
- The subgraph homeomorphism problem (Q1137871) (← links)
- Optimal covering of cacti by vertex-disjoint paths (Q1178689) (← links)
- Maintaining bridge-connected and biconnected components on-line (Q1186782) (← links)
- Validity of clusters formed by graph-theoretic cluster methods (Q1251676) (← links)
- Linear algorithms on recursive representations of trees (Q1254104) (← links)
- Efficiently searching a graph by a smell-oriented vertex process (Q1286410) (← links)
- On the equivalence of constrained and unconstrained flows (Q1339398) (← links)
- The input/output complexity of transitive closure (Q1360681) (← links)
- An algorithm for straight-line drawing of planar graphs (Q1386370) (← links)
- A linear-time algorithm for finding a one-to-many 3-disjoint path cover in the cube of a connected graph (Q1628689) (← links)
- Efficient heuristic algorithm for identifying critical nodes in planar networks (Q1734834) (← links)
- A two-level graph partitioning problem arising in mobile wireless communications (Q1744904) (← links)
- Algorithm to find a maximum 2-packing set in a cactus (Q1748991) (← links)
- Efficient algorithms for updating betweenness centrality in fully dynamic graphs (Q1750422) (← links)
- On a class of branching problems in broadcasting and distribution (Q1761092) (← links)
- A note on finding the bridges of a graph (Q1844076) (← links)
- A bootstrap heuristic for designing minimum cost survivable networks (Q1919975) (← links)
- Joint optimization of level of repair analysis and spare parts stocks (Q1926957) (← links)
- Fourier acceleration of iterative processes in disordered systems. (Q1963532) (← links)
- Producibility in hierarchical self-assembly (Q2003445) (← links)
- The combinatorics of overlapping genes (Q2013690) (← links)
- C-planarity testing of embedded clustered graphs with bounded dual carving-width (Q2041980) (← links)
- Efficient connection processing in equation-based object-oriented models (Q2073116) (← links)
- Almost envy-free allocations with connected bundles (Q2078044) (← links)
- Markov random field models for vector-based representations of landscapes (Q2078273) (← links)
- On the recognition of search trees generated by BFS and DFS (Q2087463) (← links)
- Preprocessing for outerplanar vertex deletion: an elementary kernel of quartic size (Q2093579) (← links)
- Towards interactive transition from AOC poset to concept lattice (Q2117134) (← links)
