Stem digraph$ (all stems)

18 papers:

CIAA-2015-GusevS #graph #on the

On the Number of Synchronizing Colorings of Digraphs (VVG, MS), pp. 127–139.

LICS-2015-CarvalhoMM #algebra #complexity

From Complexity to Algebra and Back: Digraph Classes, Collapsibility, and the PGP (CC, FRM, BM), pp. 462–474.

STOC-2014-KawarabayashiKK #graph #grid #problem #theorem

An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem (KiK, YK, SK), pp. 70–78.

ICALP-v1-2014-DapicMM #graph

QCSP on Semicomplete Digraphs (PD, PM, BM), pp. 847–858.

CIAA-2012-Berlinkov #automaton

Synchronizing Automata on Quasi-Eulerian Digraph (MVB), pp. 90–100.

ICALP-v1-2010-Georgiadis #graph #testing

Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s-t Paths in Digraphs (LG), pp. 738–749.

ICALP-B-2008-GruberH #automaton #finite #regular expression

Finite Automata, Digraph Connectivity, and Regular Expression Size (HG, MH), pp. 39–50.

STOC-2006-ReingoldTV #graph #problem #pseudo

Pseudorandom walks on regular digraphs and the RL vs. L problem (OR, LT, SPV), pp. 457–466.

SAC-2006-ZhouAL #database #image #interactive #retrieval #similarity #using

Dynamic interactive spatial similarity retrieval in iconic image databases using enhanced digraph (XMZ, CHA, TWL), pp. 46–51.

LICS-2005-Atserias #on the #problem

On Digraph Coloring Problems and Treewidth Duality (AA), pp. 106–115.

AGTIVE-2003-AgnarssonEH #graph

Proper Down-Coloring Simple Acyclic Digraphs (GA, ÁSE, MMH), pp. 299–312.

AGTIVE-2003-Jamison #graph

Transforming Toric Digraphs (REJ), pp. 328–333.

WIA-1999-GiammarresiPW #graph

Thompson Digraphs: A Characterization (DG, JLP, DW), pp. 91–100.

ICALP-1995-ChaudhuriZ #graph #query

Shortest Path Queries in Digraphs of Small Treewidth (SC, CDZ), pp. 244–255.

STOC-1990-KaoK #algorithm #graph #parallel #performance #towards #transitive

Towards Overcoming the Transitive-Closure Bottleneck: Efficient Parallel Algorithms for Planar Digraphs (MYK, PNK), pp. 181–192.

ICALP-1986-Simon #algorithm #graph #transitive

An Improved Algorithm for Transitive Closure on Acyclic Digraphs (KS), pp. 376–386.

ICALP-1986-SpirakisT #algorithm #performance

A Very Fast, Practical Algorithm for Finding a Negative Cycle in a Digraph (PGS, AKT), pp. 397–406.

STOC-1979-ValdesTL #graph #parallel #recognition

The recognition of Series Parallel digraphs (JV, RET, ELL), pp. 1–12.