4865 search results - page 120 / 973 » The Complexity of Graph Connectivity |
ICCSA
2004
Springer
14 years 4 months ago
2004
Springer
The algorithmic techniques which allow high efficiency in the precise calculation of the reliability of an undirected graph with absolutely reliable nodes and unreliable edges are ...
WG
2010
Springer
13 years 9 months ago
2010
Springer
The problem of determining the cutwidth of a graph is a notoriously hard problem which remains NP-complete under severe restrictions on input graphs. Until recently, non-trivial p...
COMPGEOM
2006
ACM
14 years 4 months ago
2006
ACM
This paper addresses the problem of representing the connectivity information of geometric objects using as little memory as possible. As opposed to raw compression issues, the fo...
TCS
2008
13 years 10 months ago
2008
This paper addresses the problem of representing the connectivity information of geometric objects using as little memory as possible. As opposed to raw compression issues, the fo...
COMBINATORICS
2006
13 years 10 months ago
2006
The linear complexity of a matrix is a measure of the number of additions, subtractions, and scalar multiplications required to multiply that matrix and an arbitrary vector. In th...