Drawing Graphs by Example Efficiently: Trees and Planar Acyclic Digraphs (Extended Abstract)

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-58950-3_394
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Acyclic Colourings of Planar Graphs With Large Girth

Journal of the London Mathematical Society
Mathematics
1999English

Survey on Planar Drawing of Clustered Graphs

IOSR Journal of Computer Engineering
2013English

Cubic Identity Graphs and Planar Graphs Derived From Trees

Journal of the Australian Mathematical Society
1970English

Maximum Directed Cuts in Acyclic Digraphs

Journal of Graph Theory
GeometryTopology
2007English

Polar Coordinate Drawing of Planar Graphs With Good Angular Resolution

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

Games on Graphs and Sequentially Realizable Functionals. Extended Abstract

English

Categorical Views on Computations on Trees (Extended Abstract)

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
English

Long Paths and Toughness of K-Trees and Chordal Planar Graphs

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2019English

Acyclic Edge-Coloring of Planar Graphs: $\Delta$ Colors Suffice When $\Delta$ Is Large

SIAM Journal on Discrete Mathematics
Mathematics
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy