Sciweavers

74 search results - page 6 / 15
» On edge orienting methods for graph coloring
Sort
View
GD
2006
Springer
13 years 11 months ago
Planarity Testing and Optimal Edge Insertion with Embedding Constraints
The planarization method has proven to be successful in graph drawing. The output, a combinatorial planar embedding of the so-called planarized graph, can be combined with state-o...
Carsten Gutwenger, Karsten Klein, Petra Mutzel
IV
2010
IEEE
196views Visualization» more  IV 2010»
13 years 5 months ago
3D Edge Bundling for Geographical Data Visualization
Visualization of graphs containing many nodes and edges efficiently is quite challenging since representations generally suffer from visual clutter induced by the large amount of...
Antoine Lambert, Romain Bourqui, David Auber
IDEAL
2003
Springer
14 years 17 days ago
Agent Compromises in Distributed Problem Solving
ERA is a multi-agent oriented method for solving constraint satisfaction problems [5]. In this method, agents make decisions based on the information obtained from their environmen...
Yi Tang, Jiming Liu, Xiaolong Jin
IDA
2010
Springer
13 years 9 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
SMI
2010
IEEE
120views Image Analysis» more  SMI 2010»
13 years 5 months ago
Single-Cycle Plain-Woven Objects
—It has recently been shown that if we twist an arbitrary subset of edges of a mesh on an orientable surface, the resulting extended graph rotation system (EGRS) can be used to i...
Qing Xing, Ergun Akleman, Jianer Chen, Jonathan L....