Sciweavers

402 search results - page 43 / 81
» On Finding the Number of Graph Automorphisms
Sort
View
TAP
2008
Springer
102views Hardware» more  TAP 2008»
13 years 7 months ago
Visualizing graphs in three dimensions
It has been known for some time that larger graphs can be interpreted if laid out in 3D and displayed with stereo and/or motion depth cues to support spatial perception. However, ...
Colin Ware, Peter Mitchell
COCOA
2008
Springer
13 years 9 months ago
Computational Study on Dominating Set Problem of Planar Graphs
Abstract: Recently, there have been significant theoretical progresses towards fixed-parameter algorithms for the DOMINATING SET problem of planar graphs. It is known that the prob...
Marjan Marzban, Qian-Ping Gu, Xiaohua Jia
DCG
2002
106views more  DCG 2002»
13 years 7 months ago
Perpendicular Dissections of Space
For each pair (Qi, Qj) of reference points and each real number r there is a unique hyperplane h QiQj such that d(P, Qi)2 - d(P, Qj)2 = r for points P in h. Take n reference point...
Thomas Zaslavsky
GIS
2007
ACM
13 years 11 months ago
Optimal traversal planning in road networks with navigational constraints
A frequent query in geospatial planning and decision making domains (e.g., emergency response, data acquisition, street cleaning), is to find an optimal traversal plan (OTP) that ...
Leyla Kazemi, Cyrus Shahabi, Mehdi Sharifzadeh, Lu...
ANTSW
2010
Springer
13 years 5 months ago
Autonomous Multi-agent Cycle Based Patrolling
We introduce a novel multi-agent patrolling strategy. By assumption, the swarm of agents performing the task consists of very low capability ant-like agents. The agents have littl...
Yotam Elor, Alfred M. Bruckstein