The following pages link to (Q4411363):
Displaying 13 items.
- Certifying algorithms (Q465678) (← links)
- Algorithms for computing a parameterized \(st\)-orientation (Q959815) (← links)
- Simple computation of \textit{st}-edge- and \textit{st}-numberings from ear decompositions (Q1730030) (← links)
- Balanced vertex-orderings of graphs (Q1775059) (← links)
- A self-stabilizing algorithm for constructing a minimal reachable directed acyclic graph with two senders and two targets (Q2034405) (← links)
- A diameter-revealing proof of the Bondy-Lovász lemma (Q2059880) (← links)
- Space efficient linear time algorithms for BFS, DFS and applications (Q2322695) (← links)
- Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits (Q2403234) (← links)
- An \(O(n+m)\) certifying triconnnectivity algorithm for Hamiltonian graphs (Q2429326) (← links)
- Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice (Q2638387) (← links)
- Simultaneous Orthogonal Planarity (Q2961544) (← links)
- Planar Confluent Orthogonal Drawings of 4-Modal Digraphs (Q6075712) (← links)
- $st$-Orientations with Few Transitive Edges (Q6141787) (← links)
