4865 search results - page 212 / 973 » The Complexity of Graph Connectivity |
137
click to vote
IFIPTCS
2000
15 years 7 months ago
2000
Over the years coding theory and complexity theory have benefited from a number of mutually enriching connections. This article focuses on a new connection that has emerged betwee...
172
click to vote
SODA
2012
ACM
13 years 6 months ago
2012
ACM
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
122
click to vote
SECURWARE
2008
IEEE
15 years 10 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...
124
Voted
VISSOFT
2005
IEEE
15 years 9 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 ...
113
click to vote
FSTTCS
2005
Springer
15 years 9 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...