Sciweavers

821 search results - page 3 / 165
» Addressing the Petersen graph
Sort
View
JGT
2008
77views more  JGT 2008»
13 years 6 months ago
List-coloring the square of a subcubic graph
The square G2 of a graph G is the graph with the same vertex set as G and with two vertices adjacent if their distance in G is at most 2. Thomassen showed that for a planar graph ...
Daniel W. Cranston, Seog-Jin Kim
GD
1995
Springer
13 years 9 months ago
Fast Interactive 3-D Graph Visualization
We present a 3-D version of GEM [6], a randomized adaptive layout algorithm for nicely drawing undirected graphs, based on the spring-embedder paradigm [4]. The new version, GEM-3D...
Ingo Bruß, Arne Frick
IWCMC
2006
ACM
14 years 1 days ago
Performance of Taroko: a cluster-based addressing and routing scheme for self-organized networks
Self-Organized Networks (SONs) are a general description of autonomous networks without infrastructure, of which Ad Hoc, Sensor and Mesh networks are special cases. We had previou...
Julien Ridoux, Meriem Kassar, Mathias Boc, Anne Fl...
PROFES
2009
Springer
13 years 10 months ago
The Waterfall Model in Large-Scale Development
Waterfall development is still a widely used way of working in software development companies. Many problems have been reported related to the model. Commonly accepted problems are...
Kai Petersen, Claes Wohlin, Dejan Baca
VLDB
2012
ACM
361views Database» more  VLDB 2012»
12 years 1 months ago
Answering pattern match queries in large graph databases via graph embedding
The growing popularity of graph databases has generated interesting data management problems, such as subgraph search, shortest path query, reachability verification, and pattern ...
Lei Zou, Lei Chen 0002, M. Tamer Özsu, Dongya...