Geodesic
Visibility Graphs of Staircase Polygons and the Weak Bruhat Order, I: from Visibility Graphs to Maximal Chains.
Discrete & computational geometry, Tome 14 (1995) no. 3, pp. 331-358

Voir la notice de l'article provenant de la source European Digital Mathematics Library

Mots-clés : staircase polygons, simple polygon, visibility graph, persistency, adjacency matrix, maximal chains, weak Bruhat order, polynomial-time algorithm, persistent graphs 
@article{DCG_1995__14_3_131406,
     author = {K. Kumar and J. Abello and O. Egecioglu},
     title = {Visibility {Graphs} of {Staircase} {Polygons} and the {Weak} {Bruhat} {Order,} {I:} from {Visibility} {Graphs} to {Maximal} {Chains.}},
     journal = {Discrete & computational geometry},
     pages = {331--358},
     publisher = {mathdoc},
     volume = {14},
     number = {3},
     year = {1995},
     zbl = {0835.05065},
     url = {http://geodesic.mathdoc.fr/item/DCG_1995__14_3_131406/}
}
TY  - JOUR
AU  - K. Kumar
AU  - J. Abello
AU  - O. Egecioglu
TI  - Visibility Graphs of Staircase Polygons and the Weak Bruhat Order, I: from Visibility Graphs to Maximal Chains.
JO  - Discrete & computational geometry
PY  - 1995
SP  - 331
EP  - 358
VL  - 14
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DCG_1995__14_3_131406/
ID  - DCG_1995__14_3_131406
ER  - 
%0 Journal Article
%A K. Kumar
%A J. Abello
%A O. Egecioglu
%T Visibility Graphs of Staircase Polygons and the Weak Bruhat Order, I: from Visibility Graphs to Maximal Chains.
%J Discrete & computational geometry
%D 1995
%P 331-358
%V 14
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DCG_1995__14_3_131406/
%F DCG_1995__14_3_131406
K. Kumar; J. Abello; O. Egecioglu. Visibility Graphs of Staircase Polygons and the Weak Bruhat Order, I: from Visibility Graphs to Maximal Chains.. Discrete & computational geometry, Tome 14 (1995) no. 3, pp. 331-358. http://geodesic.mathdoc.fr/item/DCG_1995__14_3_131406/