Conference paper
Compression scheme for digital cinema application
Ligang Lu, Jack L. Kouloheris
IS&T/SPIE Electronic Imaging 2002
Let G be a triangle‐free graph on n points with m edges and vertex degrees d1, d2,…, dn. Let k be the maximum number of edges in a bipartite subgraph of G. In this note we show that k ⩾ m/2 + Σ ni=1 √di. It follows as a corollary that k ⩾ m/2 + cm3/4. Copyright © 1992 Wiley Periodicals, Inc., A Wiley Company
Ligang Lu, Jack L. Kouloheris
IS&T/SPIE Electronic Imaging 2002
Martin Charles Golumbic, Renu C. Laskar
Discrete Applied Mathematics
Timothy J. Wiltshire, Joseph P. Kirk, et al.
SPIE Advanced Lithography 1998
Shu Tezuka
WSC 1991