Search Sciweavers | Sciweavers

1736 search results - page 5 / 348

» On antimagic directed graphs

click to vote

SIGMOD
2008
ACM

111views Database» more SIGMOD 2008»

Efficiently answering reachability queries on very large directed graphs

14 years 7 months ago

Download www.seas.upenn.edu

Ruoming Jin, Yang Xiang, Ning Ruan, Haixun Wang

claim paper

Read More »

click to vote

COCO
2007
Springer

114views Algorithms» more COCO 2007»

Directed Planar Reachability is in Unambiguous Log-Space

14 years 1 months ago

Download www.cse.unl.edu

We make progress in understanding the complexity of the graph reachability problem in the context of unambiguous logarithmic space computation; a restricted form of nondeterminism....

Chris Bourke, Raghunath Tewari, N. V. Vinodchandra...

claim paper

Read More »

click to vote

GBRPR
2005
Springer

120views Pattern Recognition» more GBRPR 2005»

A Direct Algorithm to Find a Largest Common Connected Induced Subgraph of Two Graphs

14 years 1 months ago

Download users.info.unicaen.fr

Abstract. We present a direct algorithm that computes a largest common connected induced subgraph of two given graphs. It is based on an eﬃcient generation of the common connecte...

Bertrand Cuissart, Jean-Jacques Hébrard

claim paper

Read More »

click to vote

WG
2007
Springer

91views Theoretical Computer Science» more WG 2007»

Characterization and Recognition of Digraphs of Bounded Kelly-width

14 years 1 months ago

Download www.ii.uib.no

Kelly-width is a parameter of directed graphs recently proposed by Hunter and Kreutzer as a directed analogue of treewidth. We give several alternative characterizations of direct...

Daniel Meister, Jan Arne Telle, Martin Vatshelle

claim paper

Read More »

101

click to vote

Book

1197views

Graph Theory with Applications

15 years 5 months ago

Download www.ecp6.jussieu.fr

A classic book on graph theory.

J.A. Bondy and U.S.R. Murty