1986 search results - page 288 / 398 » Path Separability of Graphs |
129
click to vote
CIA
2007
Springer
15 years 6 months ago
2007
Springer
: Coalition formation in social networks consisting of a graph of interdependent agents allows many choices of which task to select and with whom to partner in the social network. ...
122
Voted
GREC
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. In this paper, we propose a new approach for symbol recognition using structural signatures and a Galois Lattice as classifier. The structural signatures are based on top...
142
Voted
CAV
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. CirCUs is a satisfiability solver that works on a combination of AndInverter-Graph, CNF clauses, and BDDs. It has been designed to work well with bounded model checking. ...
DELTA
2004
IEEE
15 years 6 months ago
2004
IEEE
Complex arithmetic computations, especially if derived from bit-level software descriptions, can be very inefficient if implemented directly in hardware (e.g., by translation of t...
112
Voted
ISAAC
1995
Springer
15 years 6 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...