Tight Bounds for Testing Bipartiteness in General Graphs

Tali Kaufman

Michael Krivelevich

Dana Ron

Resumen

No disponible

PÁGINAS

pp. 1417 - 1440

NÚMERO

Volumen: 33 Número: 6 Parte: 0 (2004)

MATERIAS

REVISTAS SIMILARES

Artículos similares

Simple Tight Upper Bounds for Average SEP and BEP of Coherent Diversity M-ary Biorthogonal Signals Over Fading Channels

Acceso

Radaydeh, R.M. Pág. 2816 - 2820

Revista: IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY

Tight Bounds for Critical Sections in Processor Consistent Platforms

Acceso

Higham, L.; Kawash, J. Pág. 1072 - 1083

Revista: IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS

On the Undirected Rural Postman Problem: Tight Bounds Based on a New Formulation

Acceso

Fernandez, E. Meza, O. Garfinkel, R. Ortega, M. Pág. 281 - 291

Revista: OPERATIONS RESEARCH

CORRESPONDENCE - Tight Error Bounds for Nonuniform Signaling over AWGN Channels

Acceso

Kuai, H; Alajaji, F; Takahara, G Pág. 2712 - 2717

Revista: IEEE TRANSACTIONS ON INFORMATION THEORY

NETWORK/SYSTEM COMPUTATION & ANALYSIS - An approach for computing tight numerical bounds on renewal functions

Acceso

Ayhan, H; Limon-Robles, J; Wortman, M Pág. 182 - 188

Revista: IEEE TRANSACTIONS ON RELIABILITY

Ver todas las revistas