Algorithms for Drawing Plane Graphs(<Special Section>Foundations of Computer Science)
スポンサーリンク
概要
- 論文の詳細を見る
Graph drawing addresses the problem of constructing geometric representation of information and finds applications in almost every branch of science and technology. Efficient algorithms are essential for automatic drawings of graphs, and hence a lot of research has been carried out in the last decade by many researchers over the world to develop efficient algorithms for drawing graphs. In this paper we survey the recent algorithmic results on various drawings of plane graphs: straight line drawing, convex drawing, orthogonal drawing, rectangular drawing and box-rectangular drawing.
- 社団法人電子情報通信学会の論文
- 2004-02-01
著者
-
Nishizeki Takao
Graduate School Of Information Sciences Tohoku University
-
RAHMAN Md.
Graduate School of Engineering, Tokyo Institute of Technology
-
Rahman M
Graduate School Of Information Sciences Tohoku University
-
Nishizeki Takao
Graduate School Of Information Sciences
-
MIURA Kazuyuki
Graduate School of Information Sciences, Tohoku University
-
Miura Kazuyuki
Graduate School Of Information Sciences Tohoku University
-
Rahman Md.
Graduate School Of Bioagricultural Sciences Nagoya University:(present Address)department Of Crop Bo
関連論文
- Development of spectrum sensing system with GNU Radio and USRP to detect emergency radios (ソフトウェア無線)
- Design and implementation of emergency radio information system (ソフトウェア無線)
- Design and implementation of a cognitive radio based emergency sensor network in disaster area (ソフトウェア無線)
- List Edge-Colorings of Series-Parallel Graphs
- Linear Algorithm for Finding List Edge-Colorings of Series-Parallel Graphs (Special Issue on Selected Papers from LA Symposium)
- Quantum Card Dealing
- Necessary and Sufficient Numbers of Cards for Sharing Secret Keys on Hierarchical Groups(Special Issue on Selected Papers from LA Symposium)
- Sufficient Condition and Algorithm for List Total Colorings of Series-Parallel Graphs(Discrete Mathematics and Its Applications)
- Algorithms for Drawing Plane Graphs(Foundations of Computer Science)
- 平面グラフの格子短形描画
- On the One-Way Algebraic Homomorphism (Special Section on Cryprography and Information Security)
- Cost Total Colorings of Trees(Foundations of Computer Science)
- LA-10 A Linear Algorithm for Rectangular Drawings of Planar Graphs
- LA-9 Rectangle-of-Influence Drawings of Four-Connected Plane Graphs
- Edge-Coloring Problems for Graphs
- Mining Communities on the Web Using a Max-Flow and a Site-Oriented Framework(Data Mining)
- Partitioning a Multi-Weighted Graph to Connected Subgraphs of Almost Uniform Size(Graph Algorithms,Foundations of Computer Science)
- Algorithms for Multicolorings of Partial ★-Trees (Special Issue on Selected Papers from LA Symposium)
- Convex Drawings of Internally Triconnected Plane Graphs on O(n^2) Grids
- Best Security Index for Digital Fingerprinting(Information Hiding, Cryptography and Information Security)
- Efficient Compression of Web Graphs
- Generalized Edge-Rankings of Trees
- One-Way Functions over Finite Near-Rings
- 23386 Experimental Investigation of Retrofitted RC Column with Eccentric Wing Walls
- A Simulation of the Footsteps Illusion Using a Reaction Diffusion Model
- Self-Organized Feature Extraction in a Three-Dimensional Discrete Reaction-Diffusion System
- Farmers' Attitudes towards Participatory Resource Management for Sustainable Farming Development : a study from Bangladesh
- Effects of Exogenous Glycinebetaine on Growth and Ultrastructure of Salt-Stressed Rice Seedlings (Oryza sativa L.)
- Implementation Issues of Automatic Modulation Classification on Software Defined Radio Platform
- Robustness in Supervised Learning Based Blind Automatic Modulation Classification