1722 search results - page 103 / 345 » Variables in Concept Graphs |
CORR
2010
Springer
14 years 10 months ago
2010
Springer
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...
COCOA
2008
Springer
14 years 11 months ago
2008
Springer
In a finite simple undirected graph, a vertex is simplicial if its neighborhood is a clique. We say that, for k 2, a graph G = (VG, EG) is the k-simplicial power of a graph H = (V...
DATE
2007
IEEE
15 years 4 months ago
2007
IEEE
This paper proposes a novel algorithm that, given a data-flow graph and an input/output constraint, enumerates all convex subgraphs under the given constraint in polynomial time ...
INFOCOM
2006
IEEE
15 years 3 months ago
2006
IEEE
— We propose efficient distributed algorithms to aid navigation of a user through a geographic area covered by sensors. The sensors sense the level of danger at their locations ...
DIGRA
2005
Springer
15 years 3 months ago
2005
Springer
This paper explores the idea that future game consoles and computers may no longer be single processor units, but instead symmetrical multiprocessor units. If this were to occur g...