6 citations · 27 across the 25 of their papers we have counts for
4 papers · 1 filter
The Perfect Matching Cut Problem Revisited
Van Bang Le, Jan Arne Telle
In a graph, a perfect matching cut is an edge cut that is a perfect matching. Perfect Matching Cut (PMC) is the problem of deciding whether a given graph has a perfect matching cut…
On Dasgupta's hierarchical clustering objective and its relation to other graph parameters
Svein Høgemo, Benjamin Bergougnoux, Ulrik Brandes +2
The minimum height of vertex and edge partition trees are well-studied graph parameters known as, for instance, vertex and edge ranking number. While they are NP-hard to determine…
Classes of intersection digraphs with good algorithmic properties
Lars Jaffke, O-joung Kwon, Jan Arne Telle
An intersection digraph is a digraph where every vertex is represented by an ordered pair of sets such that there is an edge from to if and only if a…
Recognition of Linear and Star Variants of Leaf Powers is in P
Benjamin Bergougnoux, Svein Høgemo, Jan Arne Telle +1
A -leaf power of a tree is a graph whose vertices are the leaves of and whose edges connect pairs of leaves whose distance in is at most . A graph is a leaf p…