The following pages link to (Q3883524):
Displaying 50 items.
- A linear-time algorithm for four-partitioning four-connected planar graphs (Q287104) (← links)
- Path-based depth-first search for strong and biconnected components (Q294748) (← links)
- Independence entropy of \(\mathbb{Z}^{d}\)-shift spaces (Q368703) (← links)
- Topological morphing of planar graphs (Q386891) (← links)
- A heuristic method to rectify intransitive judgments in pairwise comparison matrices (Q421772) (← links)
- Fast and compact self-stabilizing verification, computation, and fault detection of an MST (Q498670) (← links)
- Polymatroidal flows with lower bounds (Q581209) (← links)
- Fast random generation of binary, t-ary and other types of trees (Q582880) (← links)
- Trémaux trees and planarity (Q661936) (← links)
- An efficient distributed algorithm for centering a spanning tree of a biconnected graph (Q671408) (← links)
- Routing on trees (Q672097) (← links)
- The smallest networks on which the Ford-Fulkerson maximum flow procedure may fail to terminate (Q672389) (← links)
- Recognition of DFS trees: Sequential and parallel algorithms with refined verifications (Q685690) (← links)
- On paths with the shortest average arc length in weighted graphs (Q686427) (← links)
- A lower bound on the period length of a distributed scheduler (Q689104) (← links)
- Creating an acceptable consensus ranking for group decision making (Q724762) (← links)
- Proving mutual termination (Q746783) (← links)
- Approximate parallel scheduling. II: Applications to logarithmic-time optimal parallel graph algorithms (Q758188) (← links)
- On approximation problems related to the independent set and vertex cover problems (Q760210) (← links)
- Ramsey numbers and an approximation algorithm for the vertex cover problem (Q762496) (← links)
- A general program scheme for finding bridges (Q787676) (← links)
- The path matrix of a graph, its construction and its use in evaluating certain products (Q793752) (← links)
- Certain NP-complete matching problems (Q794163) (← links)
- A simple version of Karzanov's blocking flow algorithm (Q795064) (← links)
- On binary tree encodements (Q795519) (← links)
- Finding pseudoperipheral nodes in graphs (Q797999) (← links)
- Finding Euler tours in parallel (Q801686) (← links)
- On area-efficient drawings of rectangular duals for VLSI floor-plan (Q802889) (← links)
- Qualitative decomposition of the eigenvalue problem in a dynamic system (Q805561) (← links)
- Improved algorithms for graph four-connectivity (Q808289) (← links)
- Safe separators for treewidth (Q819825) (← links)
- Minimum cuts in geometric intersection graphs (Q827339) (← links)
- An improved self-stabilizing algorithm for biconnectivity and bridge-connectivity (Q845956) (← links)
- Approximation algorithms for treewidth (Q848843) (← links)
- Optimal fault-tolerant routings with small routing tables for \(k\)-connected graphs (Q876733) (← links)
- Fast algorithms for robust classification with Bayesian nets (Q881796) (← links)
- The maximum flow problem of uncertain network (Q903658) (← links)
- Decomposing a relation into a tree of binary relations (Q909447) (← links)
- Computing Euclidean maximum spanning trees (Q911288) (← links)
- A new \(O(n^ 2)\) shortest chain algorithm (Q911302) (← links)
- Partitioning multi-edge graphs (Q911315) (← links)
- Dynamic maintenance of planar digraphs, with applications (Q911751) (← links)
- Introduction to graph grammars with applications to semantic networks (Q918717) (← links)
- Bipartite graphs, upward drawings, and planarity (Q918730) (← links)
- A theory of rectangular dual graphs (Q923112) (← links)
- Upward drawings of triconnected digraphs. (Q960528) (← links)
- A note on the construction of error detecting/correcting prefix codes (Q963391) (← links)
- Treewidth computations. I: Upper bounds (Q964001) (← links)
- Output feedback stabilization for a class of nonlinear time-evolution systems (Q1006702) (← links)
- On embedding a cycle in a plane graph (Q1011765) (← links)
