The following pages link to (Q3219752):
Displaying 50 items.
- A verification algorithm for inheritance hierarchies in object-oriented databases (Q287091) (← links)
- An improved fixed-parameter algorithm for vertex cover (Q293227) (← links)
- Path-based depth-first search for strong and biconnected components (Q294748) (← links)
- Quotient geometric crossovers and redundant encodings (Q418019) (← links)
- Constraint bipartite vertex cover: simpler exact algorithms and implementations (Q431922) (← links)
- Extending planar graph algorithms to \(K_{3,3}\)-free graphs (Q582121) (← links)
- The complexity of embedding orders into small products of chains (Q603886) (← links)
- Maintenance of 2- and 3-edge-connected components of graphs. I (Q685694) (← links)
- On the calculation of transitive reduction-closure of orders (Q686479) (← links)
- Consensus algorithms for the generation of all maximal bicliques (Q705493) (← links)
- On families of categorial grammars of bounded value, their learnability and related complexity questions (Q714784) (← links)
- Traversing graphs in a paging environment, BFS or DFS? (Q751281) (← links)
- Bit complexity of matrix products (Q808706) (← links)
- Refined memorization for vertex cover (Q835007) (← links)
- Generalised cumulative arrays in secret sharing (Q851749) (← links)
- Secret sharing schemes with partial broadcast channels (Q851779) (← links)
- Direct graph \(k\)-partitioning with a Kernighan-Lin like heuristic (Q867921) (← links)
- Dynamic fractional cascading (Q908708) (← links)
- Introduction to graph grammars with applications to semantic networks (Q918717) (← links)
- Improving the running time of embedded upward planarity testing (Q991781) (← links)
- Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time (Q1062764) (← links)
- Visibility between two edges of a simple polygon (Q1096432) (← links)
- On approximation behavior of the greedy triangulation for convex polygons (Q1098295) (← links)
- The complexity of ultrametric partitions on graphs (Q1098632) (← links)
- Theory of traces (Q1107296) (← links)
- An improved algorithm for transitive closure on acyclic digraphs (Q1110330) (← links)
- Large-scale network analysis with applications to transportation, communication and inference networks (Q1117845) (← links)
- State-variable planning under structural restrictions: algorithms and complexity (Q1128767) (← links)
- On the complexity of approximating the independent set problem (Q1184733) (← links)
- Counting and cutting cycles of lines and rods in space (Q1194306) (← links)
- Approximate decision algorithms for approximate congruence (Q1198006) (← links)
- The complexity of coloring games on perfect graphs (Q1202928) (← links)
- The slab dividing approach to solve the Euclidean \(P\)-center problem (Q1207325) (← links)
- I/O- and CPU-optimal recognition of strongly connected components (Q1209333) (← links)
- Testing the necklace condition for shortest tours and optimal factors in the plane (Q1262765) (← links)
- Optimal linear perfect hash families (Q1269893) (← links)
- An adaptation of SH heuristic to the location set covering problem (Q1278140) (← links)
- On the Euclidean two paths problem (Q1315995) (← links)
- Description of the connected components of a semialgebraic set in single exponential time (Q1317872) (← links)
- Approximate decision algorithms for point set congruence (Q1328753) (← links)
- A general approach to avoiding two by two submatrices (Q1332690) (← links)
- Directed \(s\)-\(t\) numberings, rubber bands, and testing digraph \(k\)-vertex connecitivity (Q1343167) (← links)
- NC algorithms for dynamically solving the all pairs shortest paths problem and related problems (Q1350623) (← links)
- Constraint programming and graph algorithms. (Q1353921) (← links)
- Secure frameproof codes, key distribution patterns, group testing algorithms and related structures (Q1569877) (← links)
- Computational analysis of a flexible assembly system design problem (Q1572965) (← links)
- Algorithms for transitive closure (Q1603584) (← links)
- An analogue of Hoffman's circulation conditions for max-balanced flows (Q1802959) (← links)
- Maintaining a topological order under edge insertions (Q1847369) (← links)
- A simplified correctness proof for a well-known algorithm computing strongly connected components. (Q1853027) (← links)
