Using ILP/SAT to Determine Pathwidth, Visibility Representations, and Other Grid-Based Graph Drawings

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-319-03841-4_40
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer International Publishing

Related search

Graph Theory and Representation of Distances: Chronomaps and Other Representations

2013English

Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2019English

Graph-Based Representations in Pattern Recognition

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

Graph Based Representations in Pattern Recognition

Computing Supplement
1998English

On Self Duality of Pathwidth in Polyhedral Graph Embeddings

Journal of Graph Theory
GeometryTopology
2007English

Hexagonal Grid Drawings: Algorithms and Lower Bounds

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Penalty-Based and Other Representations of Economic Inequality

International Journal of Uncertainty, Fuzziness and Knowlege-Based Systems
ControlSystems EngineeringInformation SystemsArtificial IntelligenceSoftware
2016English

Specification-Based Program Repair Using SAT

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Three-Dimensional 1-Bend Graph Drawings

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

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy