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
Max-Cut and Max-Bisection are NP-hard on unit disk graphs
Authors
Josep Diaz
Marcin Kaminski
Publication date
22 September 2006
Publisher
Doi
Cite
View
on
arXiv
Abstract
We prove that the Max-Cut and Max-Bisection problems are NP-hard on unit disk graphs. We also show that
λ
\lambda
λ
-precision graphs are planar for
λ
\lambda
λ
> 1 / \sqrt{2}$
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
Elsevier - Publisher Connector
See this paper in CORE
Go to the repository landing page
Download from data provider
Last time updated on 06/05/2017
Elsevier - Publisher Connector
See this paper in CORE
Go to the repository landing page
Download from data provider
Last time updated on 05/06/2019
CiteSeerX
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:CiteSeerX.psu:10.1.1.77.70...
Last time updated on 22/10/2014
DI-fusion
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:dipot.ulb.ac.be:2013/70700
Last time updated on 25/07/2012