Every Graph Admits an Unambiguous Bold Drawing

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-25878-7_32
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Every Graph Is an Integral Distance Graph in the Plane

Journal of Combinatorial Theory - Series A
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
1997English

Towards an Aesthetic Invariant for Graph Drawing

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

An Algorithm for Three-Dimensional Orthogonal Graph Drawing

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1998English

Interactive Orthogonal Graph Drawing

IEEE Transactions on Computers
HardwareArchitectureMathematicsComputational TheoryTheoretical Computer ScienceSoftware
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

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy