Akademska digitalna zbirka SLovenije - logo

Search results

Basic search    Advanced search   
Search
request
Library

Currently you are NOT authorised to access e-resources SI consortium. For full access, REGISTER.

1
hits: 2
1.
  • Coloring vertices of a grap... Coloring vertices of a graph or finding a Meyniel obstruction
    Cameron, Kathie; Lévêque, Benjamin; Maffray, Frédéric Theoretical computer science, 04/2012, Volume: 428
    Journal Article
    Peer reviewed
    Open access

    A Meyniel obstruction is an odd cycle with at least five vertices and at most one chord. A graph is Meyniel if and only if it has no Meyniel obstruction as an induced subgraph. Here we give a O(n2) ...
Full text
Available for: GEOZS, IJS, IMTLJ, KILJ, KISLJ, NLZOH, NUK, OILJ, PNG, SAZU, SBCE, SBJE, UILJ, UL, UM, UPCLJ, UPUK, ZAGLJ, ZRSKP

PDF
2.
  • A Best Possible Heuristic f... A Best Possible Heuristic for the k-Center Problem
    Hochbaum, Dorit S; Shmoys, David B Mathematics of operations research, 05/1985, Volume: 10, Issue: 2
    Journal Article
    Peer reviewed

    In this paper we present a 2-approximation algorithm for the k -center problem with triangle inequality. This result is "best possible" since for any < 2 the existence of -approximation algorithm ...
Full text
Available for: BFBNIB, INZLJ, IZUM, KILJ, NMLJ, NUK, PILJ, PNG, SAZU, UL, UM, UPUK, ZRSKP

Load filters