505 search results - page 73 / 101 » On A Graph Formalism for Ordered Edges |
68
Voted
ICCS
2003
Springer
15 years 2 months ago
2003
Springer
The exact enumeration of most interesting combinatorial problems has exponential computational complexity. The finite-lattice method reduces this complexity for most two-dimension...
ICCAD
2007
IEEE
15 years 6 months ago
2007
IEEE
— We present a new linear time technique to compute criticality information in a timing graph by dividing it into “zones”. Errors in using tightness probabilities for critica...
FSTTCS
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. This paper addresses the state explosion problem in automata based LTL model checking. To deal with large space requirements we turn to use a distributed approach. All th...
ISAAC
1995
Springer
15 years 1 months ago
1995
Springer
Given an undirected graph G, the maximal planar subgraph problem is to determine a planar subgraph H of G such that no edge of G-H can be added to H without destroying planarity. P...
101
click to vote
APSEC
2005
IEEE
15 years 3 months ago
2005
IEEE
The design and development of complex software systems is a difficult task, and it is not easy to ensure the quality of a developed software. The paper presents an architectural ...