1883 search results - page 114 / 377 » Ordered theta graphs |
CORR
2012
Springer
12 years 3 months ago
2012
Springer
The notions of subgraph centrality and communicability, based on the exponential of the adjacency matrix of the underlying graph, have been effectively used in the analysis of und...
DAC
1999
ACM
14 years 8 months ago
1999
ACM
Finding the minimum column multiplicity for a bound set of variables is an important problem in Curtis decomposition. To investigate this problem, we compared two graphcoloring pr...
WWW
2007
ACM
14 years 8 months ago
2007
ACM
Most RDF query languages allow for graph structure search through a conjunction of triples which is typically processed using join operations. A key factor in optimizing joins is ...
ICRA
2006
IEEE
14 years 1 months ago
2006
IEEE
— Mobile robot localization and navigation requires a map - the robot’s internal representation of the environment. A common problem is that path planning becomes very ineffic...
OPODIS
2001
13 years 9 months ago
2001
In their pioneering paper [4], Gallager et al. introduced a distributed algorithm for constructing the minimum-weight spanning tree (MST), many authors have suggested ways to enhan...