We discuss the nearly equitable edge coloring problem on a multigraph and propose an efficient algorithm for solving the problem, which has a better time complexity than the previ...
Abstract. The Sugiyama framework is the most commonly used concept for visualizing directed graphs. It draws them in a hierarchical way and operates in four phases: cycle removal, ...
Christian Bachmaier, Franz-Josef Brandenburg, Wolf...
It has been known since [Zyablov and Pinsker 1982] that a random q-ary code of rate 1 − Hq(ρ) − ε (where 0 < ρ < 1 − 1/q, ε > 0 and Hq(·) is the q-ary entropy ...
Glycans are molecules made from simple sugars that form complex tree structures. Glycans constitute one of the most important protein modifications, and identification of glycans...
We introduce overlap cluster graph modification problems where, other than in most previous work, the clusters of the target graph may overlap. More precisely, the studied graph p...
Michael R. Fellows, Jiong Guo, Christian Komusiewi...
We show that a random walk on a tournament on n vertices finds either a sink or a 3-cycle in expected time O √ n · log n · log∗ n , that is, sublinear both in the size of th...
We take a new look at the convex path recoloring (CPR), convex tree recoloring (CTR), and convex leaf recoloring (CLR) problems through the eyes of the independent set problem. Th...
It is shown that for every finite set of disjoint convex polygonal obstacles in the plane, with a total of n vertices, the free space around the obstacles can be partitioned into ...
Marwan Al-Jubeh, Michael Hoffmann, Mashhood Ishaqu...
In [3], the authors introduced the Generalised Character Compatibility Problem as a generalisation of the Perfect Phylogeny Problem for a set of species. This generalised problem t...
A honeynet is a portion of routed but otherwise unused address space that is instrumented for network traffic monitoring. It is an invaluable tool for understanding unwanted Intern...
Jin-yi Cai, Vinod Yegneswaran, Chris Alfeld, Paul ...