Computing roots of graphs is hard
- Rajeev Motwani
- Madhu Sudan
- 1994
- Discrete Applied Mathematics
Publications
Date
Featured collections
Popular topics
57 results at Discrete Applied Mathematics
Optimal communication channel utilization for matrix transposition and related permutations on binary cubes
- S.Lennart Johnsson
- Ching-Tien Ho
- 1994
- Discrete Applied Mathematics
A new competitive algorithm for group testing
- Amotz Bar-Noy
- Frank K. Hwang
- et al.
- 1994
- Discrete Applied Mathematics
On paths with the shortest average arc length in weighted graphs
- Shmuel Wimer
- Israel Koren
- et al.
- 1993
- Discrete Applied Mathematics
Monge and feasibility sequences in general flow problems
- Ilan Adler
- Alan J. Hoffman
- et al.
- 1993
- Discrete Applied Mathematics
Irredundancy in circular arc graphs
- Martin Charles Golumbic
- Renu C. Laskar
- 1993
- Discrete Applied Mathematics
Covering the complete graph with plane cycles
- Alan Hartman
- Yoav Medan
- 1993
- Discrete Applied Mathematics
Efficient reformulation for 0-1 programs - methods and computational results
- B.L. Dietrich
- L.F. Escudero
- et al.
- 1993
- Discrete Applied Mathematics
Balanced block spacing for VLSI layout
- Israel Cederbaum
- Israel Koren
- et al.
- 1992
- Discrete Applied Mathematics
Integer programming in VLSI design
- Prabhakar Raghavan
- 1992
- Discrete Applied Mathematics