Amanote Research
Register
Sign In
The Complexity of Several Realizability Problems for Abstract Topological Graphs
doi 10.1007/978-3-540-77537-9_16
Full Text
Open PDF
Abstract
Available in
full text
Date
Unknown
Authors
Jan Kynčl
Publisher
Springer Berlin Heidelberg
Related search
The Complexity of Dissociation Set Problems in Graphs
Discrete Applied Mathematics
Combinatorics
Applied Mathematics
Discrete Mathematics
The Complexity of Planning Problems With Simple Causal Graphs
Journal of Artificial Intelligence Research
Artificial Intelligence
Realizability of Graphs in Three Dimensions
Discrete and Computational Geometry
Combinatorics
Mathematics
Geometry
Discrete Mathematics
Computational Theory
Topology
Theoretical Computer Science
Complexity of Disjoint Paths Problems in Planar Graphs
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
On the Complexity of Shortest Path Problems on Discounted Cost Graphs
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
The Complexity of the List Partition Problem for Graphs
SIAM Journal on Discrete Mathematics
Mathematics
A Semidefinite Programming Approach to Tensegrity Theory and Realizability of Graphs
Topological Morphing of Planar Graphs
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
On the Complexity of Reinforcement in Graphs
Discussiones Mathematicae - Graph Theory
Combinatorics
Applied Mathematics
Discrete Mathematics
