Sciweavers

26 search results - page 3 / 6
» dam 1999
Sort
View
DAM
1999
81views more  DAM 1999»
13 years 7 months ago
On the Extension of Bipartite to Parity Graphs
Parity graphs form a superclass of bipartite and distance-hereditary graphs. Since their introduction, all the algorithms proposed as solutions to the recognition problem and othe...
Serafino Cicerone, Gabriele Di Stefano
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
DAM
1999
169views more  DAM 1999»
13 years 7 months ago
Approximating the Weight of Shallow Steiner Trees
This paper deals with the problem of constructing Steiner trees of minimum weight with diameter bounded by d, spanning a given set of vertices in a graph. Exact solutions or logar...
Guy Kortsarz, David Peleg
DAM
1999
90views more  DAM 1999»
13 years 7 months ago
Note on a Helicopter Search Problem on Graphs
We consider a search game on a graph in which one cop in a helicopter flying from vertex to vertex tries to catch the invisible robber. The existence of the winning program for th...
Fedor V. Fomin
DAM
1999
77views more  DAM 1999»
13 years 7 months ago
Compound Constructions of Broadcast Networks
Compound methods have been shown to be very e ective in the construction of broadcast graphs. Compound methods generate a large broadcast graph by combining multiple copies of a b...
Michael J. Dinneen, Jose A. Ventura, Mark C. Wilso...