4865 search results - page 98 / 973 » The Complexity of Graph Connectivity |
VL
2005
IEEE
14 years 3 months ago
2005
IEEE
Abstract— Visualizing software architecture faces the challenges of both data complexity and visual complexity. This paper presents an approach for visualizing software architect...
WG
2005
Springer
14 years 3 months ago
2005
Springer
We improve the current complexities for maintaining a chordal graph by starting with an empty graph and repeatedly adding or deleting edges.
IPL
2008
13 years 10 months ago
2008
We prove that on prefix-recognizable graphs reachability is complete for deterministic exponential time matching the complexity of alternating reachability. Key words: Reachabilit...
TNN
2010
13 years 5 months ago
2010
In this paper we provide theoretical and numerical analysis of a geometric activity flow network model which is aimed at explaining mathematically the scale-free functional graph s...
ISSS
1997
IEEE
14 years 2 months ago
1997
IEEE
Integer Linear Programming ILP is commonly used in high level and system level synthesis. It is an NP-Complete problem in general cases . There exists some tools that give an o...