Hexagonal Grid Drawings: Algorithms and Lower Bounds

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-31843-9_3
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Lower Bounds and Parallel Algorithms for Planar Orthogonal Grid Drawings

English

Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds

2020English

Efficient Algorithms and Lower Bounds for Robust Linear Regression

2019English

Lower Bounds

2016English

Communication Lower Bounds and Optimal Algorithms for Programs That Reference Arrays - Part 1

2013English

A Framework for ETH-tight Algorithms and Lower Bounds in Geometric Intersection Graphs

2018English

New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected Graphs

2020English

Lower Bounds and Exact Algorithms for the Graph Partitioning Problem Using Multicommodity Flows

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2001English

Slanted Orthogonal Drawings: Model, Algorithms and Evaluations

Journal of Graph Algorithms and Applications
GeometryComputer Science ApplicationsComputer ScienceMathematicsComputational TheoryTheoretical Computer ScienceTopology
2014English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy