Sciweavers

2487 search results - page 425 / 498
» Partitions of Graphs into Trees
Sort
View
DATE
2002
IEEE
74views Hardware» more  DATE 2002»
14 years 1 months ago
Maze Routing with Buffer Insertion under Transition Time Constraints
In this paper, we address the problem of simultaneous routing and buffer insertion. Recently in [12, 22], the authors considered simultaneous maze routing and buffer insertion und...
Li-Da Huang, Minghorng Lai, D. F. Wong, Youxin Gao
IWPC
2002
IEEE
14 years 1 months ago
Building Program Understanding Tools Using Visitor Combinators
Program understanding tools manipulate program represensuch as abstract syntax trees, control-flow graphs, or data-flow graphs. This paper deals with the use of visitor combinat...
Arie van Deursen, Joost Visser
STACS
2001
Springer
14 years 16 days ago
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...
Andrea E. F. Clementi, Pierluigi Crescenzi, Paolo ...
ISAAC
1998
Springer
66views Algorithms» more  ISAAC 1998»
14 years 10 days ago
A Parallel Algorithm for Sampling Matchings from an Almost Uniform Distribution
In this paper we present a randomized parallel algorithm to sample matchings from an almost uniform distribution on the set of matchings of all sizes in a graph. First we prove th...
Josep Díaz, Jordi Petit, Panagiotis Psychar...
FOCS
1992
IEEE
14 years 6 days ago
Quadratic Dynamical Systems (Preliminary Version)
The main purpose of this paper is to promote the study of computational aspects, primarily the convergence rate, of nonlinear dynamical systems from a combinatorial perspective. W...
Yuri Rabinovich, Alistair Sinclair, Avi Wigderson