The distance orientation problem

DOI10.1016/j.dam.2022.06.009OpenAlexW4293074261MaRDI QIDQ2091816

Robert Scheffler

Publication date: 2 November 2022

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2022.06.009

zbMATH Keywords

complexityplanar graphsouterplanar graphsgraph orientations2-in-4-SAT

Mathematics Subject Classification ID

Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx) Numerical methods for mathematical programming, optimization and variational techniques (65Kxx)

Cites Work

• Cycle bases in graphs characterization, algorithms, complexity, and applications
• Linear algorithms to recognize outerplanar and maximal outerplanar graphs
• Characterizations of outerplanar graphs
• Optimal linear arrangement of a rectangular grid
• Rook-Drawing for Plane Graphs
• Shape-from-shading: a survey
• A fast marching level set method for monotonically advancing fronts.
• Reducibility among Combinatorial Problems
• Optimal Assignments of Numbers to Vertices
• Optimal Linear Arrangement of Interval Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The distance orientation problem