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
research
On the Complexity of Matching Cut in Graphs of Fixed Diameter
Authors
Hoang-Oanh Le
Van Bang Le
Publication date
1 January 2016
Publisher
LIPIcs - Leibniz International Proceedings in Informatics. 27th International Symposium on Algorithms and Computation (ISAAC 2016)
Doi
Cite
Abstract
Abstract is not available.
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
Dagstuhl Research Online Publication Server
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:drops-oai.dagstuhl.de:6820
Last time updated on 14/02/2017
