5473 search results - page 819 / 1095 » On the graph isomorphism problem |
154
click to vote
IJFCS
1998
15 years 6 months ago
1998
Directed acyclic graphs (dags) are often used to model circuits. Path lengths in such dags represent circuit delays. In the vertex splitting problem, the objective is to determine...
201
click to vote
MST
2002
15 years 6 months ago
2002
Abstract. Blockwise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is f...
177
click to vote
TCAD
2002
15 years 6 months ago
2002
Many tasks in CAD, such as equivalence checking, property checking, logic synthesis, and false paths analysis require efficient Boolean reasoning for problems derived from circuits...
165
click to vote
KAIS
2010
15 years 5 months ago
2010
In systems of interacting entities such as social networks, interactions that occur regularly typically correspond to significant, yet often infrequent and hard to detect, interact...
155
click to vote
CLOUDCOM
2010
Springer
15 years 4 months ago
2010
Springer
Abstract--Commercial services for provisioning software components and virtual infrastructure in the cloud are emerging. For customers, this creates a multitude of possibilities fo...