Sciweavers

1736 search results - page 26 / 348
» On antimagic directed graphs
Sort
View
DAM
2007
129views more  DAM 2007»
13 years 7 months ago
Easy and hard instances of arc ranking in directed graphs
: In this paper we deal with the arc ranking problem of directed graphs. We give some classes of graphs for which the arc ranking problem is polynomially solvable. We prove that de...
Dariusz Dereniowski
ICDE
2007
IEEE
134views Database» more  ICDE 2007»
14 years 9 months ago
Graph Database Indexing Using Structured Graph Decomposition
We introduce a novel method of indexing graph databases in order to facilitate subgraph isomorphism and similarity queries. The index is comprised of two major data structures. Th...
David W. Williams, Jun Huan, Wei Wang 0010
RSA
2000
149views more  RSA 2000»
13 years 7 months ago
Hamilton cycles in random graphs and directed graphs
Colin Cooper, Alan M. Frieze
IPL
2007
121views more  IPL 2007»
13 years 7 months ago
Parameterized complexity of the induced subgraph problem in directed graphs
In this paper, we consider the parameterized complexity of the following problem: Given a hereditary property P on digraphs, an input digraph D and a positive integer k, does D ha...
Venkatesh Raman, Somnath Sikdar
IPL
2002
95views more  IPL 2002»
13 years 7 months ago
On a game in directed graphs
Inspired by recent algorithms for electing a leader in a distributed system, we study the following game in a directed graph: each vertex selects one of its outgoing arcs (if any)...
Alan J. Hoffman, Kate Jenkins, Tim Roughgarden