Sciweavers

2314 search results - page 167 / 463
» Minimal Partitions of a Graph
Sort
View
FAW
2009
Springer
177views Algorithms» more  FAW 2009»
15 years 10 months ago
Bounds on the Geometric Mean of Arc Lengths for Bounded-Degree Planar Graphs
Data access time becomes the main bottleneck in applications dealing with large-scale graphs. Cache-oblivious layouts, constructed to minimize the geometric mean of arc lengths of ...
Mohammad Khairul Hasan, Sung-Eui Yoon, Kyung-Yong ...
114
Voted
GD
2004
Springer
15 years 9 months ago
Visual Navigation of Compound Graphs
This paper describes a local update scheme for the algorithm of Sugiyama and Misue (IEEE Trans. on Systems, Man, and Cybernetics 21 (1991) 876–892) for drawing views of compound ...
Marcus Raitner
DAM
1999
119views more  DAM 1999»
15 years 3 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
134
Voted
MOBIHOC
2002
ACM
16 years 3 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...
ICCV
2003
IEEE
16 years 6 months ago
Automatic Video Summarization by Graph Modeling
We propose a unified approach for summarization based on the analysis of video structures and video highlights. Our approach emphasizes both the content balance and perceptual qua...
Chong-Wah Ngo, Yu-Fei Ma, HongJiang Zhang