Results 51 to 60 of about 5,081 (203)
Drawing planar graphs with many collinear vertices
Journal of Computational Geometry, 2018 Consider the following problem: Given a planar graph $G$, what is the maximum number $p$ such that $G$ has a planar straight-line drawing with $p$ collinear vertices?
Giordano Da Lozzo +4 more
doaj +1 more source
An Improvement of Reed’s Treewidth Approximation
Journal of Graph Algorithms and Applications, 2022 We present a new approximation algorithm for the treewidth problem which finds an upper bound on the treewidth and constructs a corresponding tree decomposition as well. Our algorithm is a faster variation of Reed's classical algorithm.
Mahdi Belbasi, Martin Fürer
doaj +1 more source
Treewidth-Preserving Modeling in ASP
, 2016 For ground ASP programs where an appropriate graph representation has bounded treewidth, algorithms that exploit this bound on the treewidth theoretically only require linear time for checking existence of an answer set.
Moldovan, Marius +4 more
core +4 more sources
On Low Treewidth Graphs and Supertrees
Journal of Graph Algorithms and Applications, 2015 Compatibility of unrooted phylogenetic trees is a well studied problem in phylogenetics. It asks to determine whether for a set of k input trees T1,...,Tk there exists a larger tree (called a supertree) that contains the topologies of all k input trees ...
Alexander Grigoriev +2 more
doaj +1 more source
The pathwidth and treewidth of cographs [PDF]
SIAM Journal on Discrete Mathematics, 1990 Summary: It is shown that the pathwidth of a cograph equals its treewidth, and a linear time algorithm to determine the pathwidth of a cograph and build a corresponding path-decomposition is given.
Hans L. Bodlaender, Rolf H. Möhring
openaire +3 more sources
On the treewidth of triangulated 3-manifolds
Journal of Computational Geometry, 2019 In graph theory, as well as in 3-manifold topology, there exist several width-type parameters to describe how "simple" or "thin" a given graph or 3-manifold is.
Kristóf Huszár +2 more
doaj +1 more source
On the Pathwidth of Hyperbolic 3-Manifolds
Computing in Geometry and Topology, 2022 According to Mostow's celebrated rigidity theorem, the geometry of closed hyperbolic 3-manifolds is already determined by their topology. In particular, the volume of such manifolds is a topological invariant and, as such, has been subject of ...
Kristóf Huszár
doaj +1 more source
Allocation of Indivisible Items With a Common Preference Graph: Minimizing Total Dissatisfaction
Networks, EarlyView.ABSTRACT Allocating indivisible items among a set of agents is a frequently studied discrete optimization problem. In the setting considered in this work, the agents' preferences over the items are assumed to be identical. We consider a very recent measure for the overall quality of an allocation which does not rely on numerical valuations of the items.
Nina Chiarelli +6 more
wiley +1 more source
Turbocharging Treewidth Heuristics [PDF]
Algorithmica, 2018 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Serge Gaspers +4 more
openaire +4 more sources
Knot Diagrams of Treewidth Two [PDF]
, 2019 In this paper, we study knot diagrams for which the underlying graph has treewidth two. We give a linear time algorithm for the following problem: given a knot diagram of treewidth two, does it represent the unknot?
Fomin, Fedor +10 more
core +3 more sources