Sciweavers

2612 search results - page 77 / 523
» Switching Graphs and Their Complexity
Sort
View
WDAG
2004
Springer
130views Algorithms» more  WDAG 2004»
14 years 3 months ago
Distributed Weighted Matching
Abstract. In this paper, we present fast and fully distributed algorithms for matching in weighted trees and general weighted graphs. The time complexity as well as the approximati...
Mirjam Wattenhofer, Roger Wattenhofer
APVIS
2008
13 years 11 months ago
Energy-Based Hierarchical Edge Clustering of Graphs
Effectively visualizing complex node-link graphs which depict relationships among data nodes is a challenging task due to the clutter and occlusion resulting from an excessive amo...
Hong Zhou, Xiaoru Yuan, Weiwei Cui, Huamin Qu, Bao...
ICDM
2009
IEEE
139views Data Mining» more  ICDM 2009»
13 years 7 months ago
Frequent Pattern Discovery from a Single Graph with Quantitative Itemsets
In this paper, we focus on a single graph whose vertices contain a set of quantitative attributes. Several networks can be naturally represented in this complex graph. An example i...
Yuuki Miyoshi, Tomonobu Ozaki, Takenao Ohkawa
JSYML
2010
95views more  JSYML 2010»
13 years 4 months ago
Some natural decision problems in automatic graphs
For automatic and recursive graphs, we investigate the following problems: (A) existence of a Hamiltonian path and existence of an infinite path in a tree (B) existence of an Euler...
Dietrich Kuske, Markus Lohrey
CIB
2005
125views more  CIB 2005»
13 years 10 months ago
An On-Line Web Visualization System with Filtering and Clustering Graph
A Web graph refers to the graph that is used to represent relationships between Web pages in cyberspace, where a node represents a URL and an edge indicates a link between two URLs...
Wei Lai, Xiaodi Huang, Ronald Wibowo, Jiro Tanaka