2503 search results - page 76 / 501 » A study of 3-arc graphs |
178
click to vote
FSTTCS
2008
Springer
15 years 7 months ago
2008
Springer
ABSTRACT. We study the problem of space-efficient polynomial-time algorithms for directed stconnectivity (STCON). Given a directed graph G, and a pair of vertices s, t, the STCON ...
198
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
In this paper, we study the problem of nonnegative graph
embedding, originally investigated in [14] for reaping the
benefits from both nonnegative data factorization and the
spe...
161
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
We introduce a general formulation, called non-negative graph embedding, for non-negative data decomposition by integrating the characteristics of both intrinsic and penalty graph...
144
click to vote
CHI
2006
ACM
16 years 6 months ago
2006
ACM
As graph models are applied to more widely varying fields, researchers struggle with tools for exploring and analyzing these structures. We describe GUESS, a novel system for grap...
152
click to vote
ICSM
2009
IEEE
16 years 20 days ago
2009
IEEE
Program call graph representation can be used to support many tasks in compiler optimization, program comprehension, and software maintenance. During software evolution, the call ...