74 search results - page 1 / 15 » The Cyclic Wirelength of Trees |
DAM
1998
13 years 4 months ago
1998
DM
2002
13 years 4 months ago
2002
We disprove a conjecture of Bultena and Ruskey [1], that all trees which are cyclic graphs of cyclic Gray codes have diameter 2 or 4, by producing codes whose cyclic graphs are tre...
EURODAC
1994
IEEE
13 years 9 months ago
1994
IEEE
Clock routing has become a critical issue in the layout design of high-performance systems. We show that the two passes bottom-up and top-down of the DME algorithm 2, 3, 4, 8 can ...
ACS
2008
13 years 4 months ago
2008
We show that the Priestley sum of finite trees contains no cyclic finite poset.
PPDP
2001
Springer
13 years 9 months ago
2001
Springer
Cyclic data structures can be tricky to create and manipulate in declarative programming languages. In a declarative setting, a natural way to view cyclic structures is as denotin...