42 search results - page 7 / 9 » Combinatorial characterization of the Assur graphs from engi... |
ISPASS
2009
IEEE
14 years 2 months ago
2009
IEEE
Until recently, parallel programming has largely focused on the exploitation of data-parallelism in dense matrix programs. However, many important application domains, including m...
ESA
1993
Springer
13 years 11 months ago
1993
Springer
A digraph is upward planar if it has a planar drawing such that all the edges are monotone with respect to the vertical direction. Testing upward planarity and constructing upward ...
ICALP
2003
Springer
14 years 22 days ago
2003
Springer
Abstract. We introduce a concept of similarity between vertices of directed graphs. Let GA and GB be two directed graphs with respectively nA and nB vertices. We define a nA × nB...
ICSM
2002
IEEE
14 years 14 days ago
2002
IEEE
When a software system enters the maintenance phase, the availability of accurate and consistent information about its organization can help alleviate the difficulties of program...
ICQNM
2007
IEEE
14 years 1 months ago
2007
IEEE
— From a geometric viewpoint, quantum nonlocality between two parties is represented as the difference of two convex bodies, namely the sets of possible results of classical and ...