199 search results - page 15 / 40 » Connectivity of addable graph classes |
COCOON
1999
Springer
13 years 12 months ago
1999
Springer
We investigate various problems related to circulant graphs – finding the shortest path between two vertices, finding the shortest loop, and computing the diameter. These probl...
IWPEC
2004
Springer
14 years 29 days ago
2004
Springer
In the precoloring extension problem (PrExt) a graph is given with some of the vertices having a preassigned color and it has to be decided whether this coloring can be extended to...
IPPS
2007
IEEE
14 years 1 months ago
2007
IEEE
Search-based graph queries, such as finding short paths and isomorphic subgraphs, are dominated by memory latency. If input graphs can be partitioned appropriately, large cluster...
DLOG
2003
13 years 9 months ago
2003
In this paper we formalise compilation of the conjunctive bodies of a restricted class of Horn rules into updates on terminologies. This involves a pre-processing of the graphs re...
ESA
1997
Springer
13 years 11 months ago
1997
Springer
In thispaper we introduce a new class of dynamicgraphalgorithmscalledquasi-fully dynamic algorithms,which are much more general than the backtracking algorithmsand are much simple...