scientific article; zbMATH DE number 432813

MaRDI QIDQ3138947zbMATH OpenFDO

Authors Muralidharan S. Kodialam, James B. Orlin

Publication date 20 October 1993

zbMATH Keywords

integer programminginfinite graphsVLSIperiodic graphsstrong connectivity

Mathematics Subject Classification ID

Linear programming (90C05) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40)

Cited in

(1)

• Polynomial time analysis of toroidal periodic graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3138947)