Sciweavers

1736 search results - page 90 / 348
» On antimagic directed graphs
Sort
View
INFOCOM
2006
IEEE
14 years 4 months ago
Sampling Techniques for Large, Dynamic Graphs
— Peer-to-peer systems are becoming increasingly popular, with millions of simultaneous users and a wide range of applications. Understanding existing systems and devising new pe...
Daniel Stutzbach, Reza Rejaie, Nick G. Duffield, S...
ICASSP
2011
IEEE
13 years 2 months ago
Seismic waves estimation and wave field decomposition with factor graphs
Physical wave fields are often described by means of a vector field. Advances in sensor technology enable us to collect an increasing number of measurement at the same location ...
Stefano Maranò, Christoph Reller, Donat Fah...
CORR
2008
Springer
120views Education» more  CORR 2008»
13 years 11 months ago
Menger's Paths with Minimum Mergings
For an acyclic directed graph with multiple sources and multiple sinks, we prove that one can choose the Menger's paths between the sources and the sinks such that the number...
Guangyue Han
JUCS
2008
123views more  JUCS 2008»
13 years 10 months ago
Instruction Scheduling Based on Subgraph Isomorphism for a High Performance Computer Processor
: This paper1 presents an instruction scheduling algorithm based on the Subgraph Isomorphism Problem. Given a Directed Acyclic Graph (DAG) G1, our algorithm looks for a subgraph G2...
Ricardo Santos, Rodolfo Azevedo, Guido Araujo
PODC
2003
ACM
14 years 4 months ago
Compact roundtrip routing with topology-independent node names
This paper presents compact roundtrip routing schemes with local tables of size ˜O( √ n) and stretch 6 for any directed network with arbitrary edge weights; and with local tabl...
Marta Arias, Lenore Cowen, Kofi A. Laing