Sciweavers

6598 search results - page 377 / 1320
» Graph Theory with Applications
Sort
View
WG
1998
Springer
15 years 11 months ago
Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width
Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones....
Bruno Courcelle, Johann A. Makowsky, Udi Rotics
IJCAI
2007
15 years 8 months ago
Edge Partitioning in External-Memory Graph Search
There is currently much interest in using external memory, such as disk storage, to scale up graph-search algorithms. Recent work shows that the local structure of a graph can be ...
Rong Zhou, Eric A. Hansen
AAAI
2004
15 years 8 months ago
A General Solution to the Graph History Interaction Problem
Since the state space of most games is a directed graph, many game-playing systems detect repeated positions with a transposition table. This approach can reduce search effort by ...
Akihiro Kishimoto, Martin Müller 0003
DBA
2004
94views Database» more  DBA 2004»
15 years 8 months ago
Structural Knowledge Graph Navigator for the Icons Prototype
Structural Knowledge Graph Navigator (SKGN) supports end users of Web applications by simple means for ad hoc querying and browsing in an object-oriented database. The interface h...
Mariusz Trzaska, Kazimierz Subieta
CORR
2010
Springer
81views Education» more  CORR 2010»
15 years 6 months ago
On the size of identifying codes in triangle-free graphs
In an undirected graph G = (V, E), a subset C V such that C is a dominating set of G, and each vertex in V is dominated by a distinct subset of vertices from C, is called an iden...
Florent Foucaud, Ralf Klasing, Adrian Kosowski, An...