Can Visibility Graphs Be Represented Compactly?.

N. Alon; S. Suri; P.K. Agarwal; B. Aronov

Discrete & computational geometry (1994)

  • Volume: 12, Issue: 3, page 347-366
  • ISSN: 0179-5376; 1432-0444/e

How to cite

top

Alon, N., et al. "Can Visibility Graphs Be Represented Compactly?.." Discrete & computational geometry 12.3 (1994): 347-366. <http://eudml.org/doc/131336>.

@article{Alon1994,
author = {Alon, N., Suri, S., Agarwal, P.K., Aronov, B.},
journal = {Discrete & computational geometry},
keywords = {visibility graph; clique cover},
number = {3},
pages = {347-366},
title = {Can Visibility Graphs Be Represented Compactly?.},
url = {http://eudml.org/doc/131336},
volume = {12},
year = {1994},
}

TY - JOUR
AU - Alon, N.
AU - Suri, S.
AU - Agarwal, P.K.
AU - Aronov, B.
TI - Can Visibility Graphs Be Represented Compactly?.
JO - Discrete & computational geometry
PY - 1994
VL - 12
IS - 3
SP - 347
EP - 366
KW - visibility graph; clique cover
UR - http://eudml.org/doc/131336
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.