5100 search results - page 366 / 1020 » The Linear Complexity of a Graph |
126
click to vote
ENDM
2007
15 years 6 months ago
2007
An s-graph is a graph with two kind of edges: subdivisible edges and real edges. A realisation of an s-graph B is any graph obtained by subdividing subdivisible edges of B into pa...
156
click to vote
DATE
2007
IEEE
16 years 18 days 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 ...
166
click to vote
MFCS
2007
Springer
16 years 12 days ago
2007
Springer
A tournament is a graph in which each pair of distinct vertices is connected by exactly one directed edge. Tournaments are an important graph class, for which isomorphism testing ...
178
click to vote
GD
2005
Springer
15 years 11 months ago
2005
Springer
This paper describes the GEOMI system, a visual analysis tool for the visualisation and analysis of large and complex networks. GEOMI provides a collection of network analysis meth...
145
click to vote
VLDB
2005
ACM
15 years 11 months ago
2005
ACM
Existing work for query processing over graph data models often relies on pre-computing the transitive closure or path indexes. In this paper, we propose a family of stack-based a...