Home
Scholarly Works
An Optimal Algorithm for Finding Maximum Induced...
Conference

An Optimal Algorithm for Finding Maximum Induced Bipartitie Subgraphs of Circular-Arc Graphs.

Authors

Zheng S-Q

Editors

Koczkodaj WW; Lauer PE; Toptsis AA

Pagination

pp. 50-53

Publisher

IEEE Computer Society

Publication Date

January 1, 1992

ISBN-10

0-8186-2812-X

Conference proceedings

ICCI

Contact the Experts team