87 search results - page 6 / 18 » Maintenance of Transitive Closures and Transitive Reductions... |
GLVLSI
2006
IEEE
14 years 1 months ago
2006
IEEE
In modern IC design, the number of long on-chip wires has been growing rapidly because of the increasing circuit complexity. Interconnect delay has dominated over gate delay as te...
WG
2004
Springer
14 years 24 days ago
2004
Springer
An undirected graph is a treelike comparability graph if it admits a transitive orientation such that its transitive reduction is a tree. We show that treelike comparability graphs...
ICALP
2010
Springer
14 years 8 days ago
2010
Springer
We show that the downward-closure of a Petri net language is effectively computable. This is mainly done by using the notions defined for showing decidability of the reachability...
ASPDAC
2005
ACM
13 years 9 months ago
2005
ACM
In order to handle device matching for analog circuits, some pairs of modules need to be placed symmetrically with respect to a common axis. In this paper, we deal with the module...
CTRSA
2007
Springer
14 years 1 months ago
2007
Springer
In 2002, Micali and Rivest raised an open problem as to whether directed transitive signatures exist or not. In 2003, Hohenberger formalized the necessary mathematical criteria for...