Search Results - "planar graph algorithm"

Improved Compact Visibility Representation of Planar Graph via Schnyder’s Realizer: Improved compact visibility representation of planar graphs via Schnyder's realizer

Authors: Lin, C.-C. Lu, Hsueh-I Sun, I-F.

Contributors: Lin, C.-C. Lu, Hsueh-I Sun, I-F.

Source: Lecture Notes in Computer Science ISBN: 9783540006237

Subject Terms: Computational Geometry (cs.CG), FOS: Computer and information sciences, B.7.2, I.3.6, Graph representations (geometric and intersection representations, etc.), G.2.2, 0102 computer and information sciences, 01 natural sciences, graph drawing, Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.), Graph algorithms (graph-theoretic aspects), Graph theory (including graph drawing) in computer science, Computer graphics, computational geometry (digital and algorithmic aspects), Applications of graph theory to circuits and networks, Computer Science - Data Structures and Algorithms, Computer Science - Computational Geometry, Data Structures and Algorithms (cs.DS), canonical ordering, F.2.2, E.1, planar graph algorithm

File Description: application/xml

Access URL: http://arxiv.org/abs/cs/0212054
http://ntur.lib.ntu.edu.tw/bitstream/246246/214029/1/93.pdf
https://zbmath.org/2139160
https://doi.org/10.1137/s0895480103420744
https://arxiv.org/pdf/cs/0212054.pdf
https://arxiv.org/abs/cs/0212054
https://ui.adsabs.harvard.edu/abs/2002cs.......12054L/abstract

Orderly Spanning Trees with Applications: Orderly spanning trees with applications

Authors: CHIANG, YI-TING LIN, CHING-CHI LU, HSUEH-I

Contributors: CHIANG, YI-TING LIN, CHING-CHI LU, HSUEH-I

Source: SIAM Journal on Computing. 34:924-945

Subject Terms: FOS: Computer and information sciences, Data structures, Discrete Mathematics (cs.DM), Graph representations (geometric and intersection representations, etc.), E.4, graph encoding, triangulation, G.2.2, 0102 computer and information sciences, 01 natural sciences, Graph algorithms (graph-theoretic aspects), Computer graphics, computational geometry (digital and algorithmic aspects), Applications of graph theory to circuits and networks, succinct data structure, Computer Science - Data Structures and Algorithms, F.2.2, E.1, Data Structures and Algorithms (cs.DS), canonical ordering, data compression, planar graph algorithm, unit-cost RAM model, graph drawing, realizer, Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.), Graph theory (including graph drawing) in computer science, visibility representation, Computer Science - Discrete Mathematics

File Description: application/xml; application/pdf; 293444 bytes

Access URL: http://arxiv.org/pdf/cs/0102006
http://arxiv.org/abs/cs/0102006
http://arxiv.org/pdf/cs/0102006.pdf
https://ui.adsabs.harvard.edu/abs/2001cs........2006C/abstract
https://arxiv.org/abs/cs/0102006

IMPROVED COMPACT VISIBILITY REPRESENTATION OF Planar Graph via Schnyder’s Realizer

Authors: Ching-chi Lin Hsueh-i Lu I-fan Sun et al.

Contributors: Ching-chi Lin Hsueh-i Lu I-fan Sun et al.

Source: http://w.csie.org/~hil/paper/sidma04.pdf.

Subject Terms: Key words. visibility representation, planar graph algorithm, graph drawing, realizer, canonical

File Description: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.107.8294; http://w.csie.org/~hil/paper/sidma04.pdf

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.107.8294
http://w.csie.org/~hil/paper/sidma04.pdf