Sciweavers

3204 search results - page 132 / 641
» The Alcuin Number of a Graph
Sort
View
WG
2010
Springer
13 years 6 months ago
Graphs that Admit Right Angle Crossing Drawings
We consider right angle crossing (RAC) drawings of graphs in which the edges are represented by polygonal arcs and any two edges can cross only at a right angle. We show that if a ...
Karin Arikushi, Radoslav Fulek, Balázs Kesz...
WDAG
2007
Springer
105views Algorithms» more  WDAG 2007»
14 years 2 months ago
Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links
A group of identical mobile agents moving asynchronously among the nodes of an anonymous network have to gather together in a single node of the graph. This problem known as the (a...
Jérémie Chalopin, Shantanu Das, Nico...
SCOPES
2004
Springer
14 years 1 months ago
Compact Procedural Implementation in DSP Software Synthesis Through Recursive Graph Decomposition
Abstract. Synthesis of digital signal processing (DSP) software from dataflow-based formal models is an effective approach for tackling the complexity of modern DSP applications. I...
Ming-Yung Ko, Praveen K. Murthy, Shuvra S. Bhattac...
ASUNAM
2011
IEEE
12 years 8 months ago
DisNet: A Framework for Distributed Graph Computation
—With the rise of network science as an exciting interdisciplinary research topic, efficient graph algorithms are in high demand. Problematically, many such algorithms measuring...
Ryan Lichtenwalter, Nitesh V. Chawla
ESA
2005
Springer
128views Algorithms» more  ESA 2005»
14 years 1 months ago
Greedy Routing in Tree-Decomposed Graphs
Milgram’s experiment (1967) demonstrated that there are short chains of acquaintances between individuals, and that these chains can be discovered in a greedy manner. Kleinberg ...
Pierre Fraigniaud