2125 search results - page 55 / 425 » On Graph Complexity |
VISSOFT
2005
IEEE
14 years 1 months ago
2005
IEEE
Dominance analysis from graph theory allows one to locate subordinated software elements in a rooted dependency graph. It identifies the nesting structure for a dependency graph ...
FSTTCS
2005
Springer
14 years 1 months ago
2005
Springer
We investigate the s-t-connectivity problem for directed planar graphs, which is hard for L and is contained in NL but is not known to be complete. We show that this problem is log...
SECURWARE
2008
IEEE
14 years 2 months ago
2008
IEEE
Trust network analysis with subjective logic (TNA-SL) simplifies complex trust graphs into series-parallel graphs by removing the most uncertain paths to obtain a canonical graph...
COCO
2006
Springer
13 years 11 months ago
2006
Springer
We study the complexity of restricted versions of s-t-connectivity, which is the standard complete problem for NL. In particular, we focus on different classes of planar graphs, o...
STACS
1995
Springer
13 years 11 months ago
1995
Springer
Abstract. A solid object in 3-dimensional space may be described by a collection of all its topologically distinct 2-dimensional appearances, its aspect graph. In this paper, we st...