Colorability in Orthogonal Graph Drawing

doi 10.1007/978-3-540-77537-9_32
Full Text
Abstract

Available in full text

Date

Unknown

Authors
Publisher

Springer Berlin Heidelberg

Related search

Interactive Orthogonal Graph Drawing

IEEE Transactions on Computers
HardwareArchitectureMathematicsComputational TheoryTheoretical Computer ScienceSoftware
1998English

An Algorithm for Three-Dimensional Orthogonal Graph Drawing

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1998English

Graph Drawing Contest Report

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Graph Drawing Contest Report

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Using Graph Parsing for Automatic Graph Drawing

IEEE Transactions on Systems, Man, and Cybernetics Part A:Systems and Humans
ControlSystems EngineeringInformation SystemsHuman-Computer InteractionElectronic EngineeringComputer Science ApplicationsElectricalSoftware
1998English

Graph-Drawing Contest Report

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1997English

Graph-Drawing Contest Report

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

The Graph Drawing Server

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

Metrics for Graph Drawing Aesthetics

Journal of Visual Languages and Computing
LinguisticsComputer Science ApplicationsHuman-Computer InteractionLanguage
2002English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy