Pages that link to "Item:Q1110330"

The following pages link to An improved algorithm for transitive closure on acyclic digraphs (Q1110330):

Displaying 19 items.

• The complexity of embedding orders into small products of chains (Q603886) (← links)
• On the calculation of transitive reduction-closure of orders (Q686479) (← links)
• Acyclic networks maximizing the printing complexity (Q703493) (← links)
• An algorithm for transitive reduction of an acyclic graph (Q1124350) (← links)
• Speeding up dynamic transitive closure for bounded degree graphs (Q1323330) (← links)
• A new variant of the \(A^*\)-algorithm which closes a node at most once. (Q1354068) (← links)
• \(q\)-distributions and Markov processes (Q1363655) (← links)
• Algorithms for transitive closure (Q1603584) (← links)
• Sharing the cost of maximum quality optimal spanning trees (Q1979176) (← links)
• An analytic approach to the asymptotic variance of trie statistics and related structures (Q2437771) (← links)
• A phase transition phenomenon in a random directed acyclic graph (Q2712580) (← links)
• Acyclic Digraphs (Q3120435) (← links)
• A Path Cover Technique for LCAs in Dags (Q3512461) (← links)
• Generalized Polychotomic Encoding: A Very Short Bit-Vector Encoding of Tree Hierarchies (Q3627677) (← links)
• Complexité de problèmes liés aux graphes sans circuit (Q3773334) (← links)
• (Q4211738) (← links)
• Transitive closure and transitive reduction in bidirected graphs (Q5227103) (← links)
• (Q5365129) (← links)
• An Abstract Domain Extending Difference-Bound Matrices with Disequality Constraints (Q5452614) (← links)