CORE
🇺🇦Â
 make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
Algorithms for the Maximum Induced Bipartite Subgraph Problem on Interval and Circular-Arc Graphs
Authors
Rachel Manber
Giri Narasimhan
Publication date
1 January 1987
Publisher
University of Wisconsin-Madison Department of Computer Sciences
Abstract
Abstract is not available.
Similar works
Full text
Available Versions
Minds@University of Wisconsin
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:minds.wisconsin.edu:1793/5...
Last time updated on 25/06/2012
