Sciweavers

123 search results - page 5 / 25
» Graph Orientation Algorithms to Minimize the Maximum Outdegr...
Sort
View
DM
1999
145views more  DM 1999»
13 years 5 months ago
Modular decomposition and transitive orientation
A module of an undirected graph is a set X of nodes such for each node x not in X , either every member of X is adjacent to x, or no member of X is adjacent to x. There is a canon...
Ross M. McConnell, Jeremy Spinrad
MOBIHOC
2002
ACM
14 years 5 months ago
Algorithmic aspects of topology control problems for ad hoc networks
Topology control problems are concerned with the assignment of power values to the nodes of an ad hoc network so that the power assignment leads to a graph topology satisfying som...
Errol L. Lloyd, Rui Liu, Madhav V. Marathe, Ram Ra...
IDA
2010
Springer
13 years 7 months ago
A Framework for Path-Oriented Network Simplification
Abstract. We propose a generic framework and methods for simplification of large networks. The methods can be used to improve the understandability of a given network, to complemen...
Hannu Toivonen, Sébastien Mahler, Fang Zhou
DAM
1999
119views more  DAM 1999»
13 years 5 months ago
On the Algorithmic Complexity of Twelve Covering and Independence Parameters of Graphs
The definitions of four previously studied parameters related to total coverings and total matchings of graphs can be restricted, thereby obtaining eight parameters related to cov...
David Manlove
3DIM
2005
IEEE
13 years 11 months ago
Globally Convergent Range Image Registration by Graph Kernel Algorithm
Automatic range image registration without any knowledge of the viewpoint requires identification of common regions across different range images and then establishing point corr...
Radim Sára, Ikuko Shimizu Okatani, Akihiro ...