David Muradian

List of publications from the DBLP Bibliography Server - FAQ

Ask others: ACM DL/Guide -

- CSB - MetaPress - Google - Bing - Yahoo

2003

1 David Muradian: The bandwidth minimization problem for cyclic caterpillars with hair length 1 is NP-complete. Theor. Comput. Sci. 307(3): 567-572 (2003)

	2003
1		David Muradian: The bandwidth minimization problem for cyclic caterpillars with hair length 1 is NP-complete. Theor. Comput. Sci. 307(3): 567-572 (2003)

Last update Sun Jun 3 16:06:10 2012 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page