Sciweavers

207 search results - page 7 / 42
» Powers of cycles, powers of paths, and distance graphs
Sort
View
GD
2004
Springer
14 years 29 days ago
Drawing Power Law Graphs
It has been noted that many realistic graphs have a power law degree distribution and exhibit the small world phenomenon. We present drawing methods influenced by recent developm...
Reid Andersen, Fan R. K. Chung, Lincoln Lu
COCOA
2008
Springer
13 years 9 months ago
Simplicial Powers of Graphs
In a finite simple undirected graph, a vertex is simplicial if its neighborhood is a clique. We say that, for k 2, a graph G = (VG, EG) is the k-simplicial power of a graph H = (V...
Andreas Brandstädt, Van Bang Le
WWW
2004
ACM
14 years 8 months ago
SPT-based topology algorithm for constructing power efficient wireless ad hoc networks
In this paper, we present a localized Shortest Path Tree (SPT) based algorithm for constructing a sub-network with the minimum-energy property for a given wireless ad hoc network....
Szu-Chi Wang, David S. L. Wei, Sy-Yen Kuo
WIRN
2005
Springer
14 years 1 months ago
Recursive Neural Networks and Graphs: Dealing with Cycles
Recursive neural networks are a powerful tool for processing structured data. According to the recursive learning paradigm, the input information consists of directed positional ac...
Monica Bianchini, Marco Gori, Lorenzo Sarti, Franc...
WG
2005
Springer
14 years 1 months ago
Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time
Broadcast domination was introduced by Erwin in 2002, and it is a variant of the standard dominating set problem, such that vertices can be assigned various domination powers. Broa...
Pinar Heggernes, Daniel Lokshtanov