Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
oaioai:dipot.ulb.ac.be:2013/52871

Minimum Entropy Orientations

Authors
Publication date
1 January 2008
Publisher
Doi

    Abstract

    We study graph orientations that minimize the entropy of the in-degree sequence. We prove that the minimum entropy orientation problem is NP-hard even if the graph is planar, and that there exists a simple linear-time algorithm that returns an approximate solution with an additive error guarantee of 1 bit. © 2008 Universite Libre de Bruxelles, Belgium.info:eu-repo/semantics/publishe

    Similar works

    Full text

    thumbnail-image

    DI-fusion

    redirect
    oaioai:dipot.ulb.ac.be:2013/52871
    Last time updated on 25/07/2012

    This paper was published in DI-fusion.

    Having an issue?

    Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.