Search Sciweavers | Sciweavers

16

SIAMDM
2010

166views more SIAMDM 2010»

Direct Product Factorization of Bipartite Graphs with Bipartition-reversing Involutions

13 years 6 months ago

Given a connected bipartite graph G, we describe a procedure which enumerates and computes all graphs H (if any) for which there is a direct product factorization G ∼= H × K2. W...

Ghidewon Abay-Asmerom, Richard Hammack, Craig E. L...

claim paper

Read More »

26

click to vote

ICML
2007
IEEE

204views Machine Learning» more ICML 2007»

Constructing basis functions from directed graphs for value function approximation

14 years 8 months ago

Download www.machinelearning.org

Basis functions derived from an undirected graph connecting nearby samples from a Markov decision process (MDP) have proven useful for approximating value functions. The success o...

Jeffrey Johns, Sridhar Mahadevan

claim paper

Read More »

26

click to vote

STACS
2005
Springer

129views Theoretical Computer Science» more STACS 2005»

A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs

14 years 1 months ago

Download domino.mpi-inf.mpg.de

Abstract. We consider the problem of computing a minimum cycle basis in a directed graph G with m arcs and n vertices. The arcs of G have non-negative weights assigned to them. We ...

Telikepalli Kavitha, Kurt Mehlhorn

claim paper

Read More »

21

click to vote

ALGORITHMICA
2000

85views more ALGORITHMICA 2000»

An Algorithm for Enumerating All Spanning Trees of a Directed Graph

13 years 7 months ago

Download eprints.iisc.ernet.in

We present an O(NV +V 3) time algorithm for enumerating all spanning trees of a directed graph. This improves the previous best known bound of O(NE + V + E) [1] when V 2 = o(N), wh...

Sanjiv Kapoor, H. Ramesh

claim paper

Read More »

43

click to vote

SIGMOD
2008
ACM

111views Database» more SIGMOD 2008»

Efficiently answering reachability queries on very large directed graphs

14 years 8 months ago