Graph layout problems are a particular class of combinatorial optimization problems whose
goal is to find a linear layout of an input graph in such way that a certain objective cost is …

The second volume of “Advancing Uncertain Combinatorics through Graphization,
Hyperization, and Uncertainization: Fuzzy, Neutrosophic, Soft, Rough, and Beyond” …

Graph theory is afundamental branch of mathematicsthat studiesnetworksconsisting of
nodes (vertices) and their connections (edges). Extensive research has been conducted on …

The computational reconstruction of genome sequences from shotgun sequencing data has
been greatly simplified by the advent of sequencing technologies that generate long reads …

For many fixed-parameter problems that are trivially soluable in polynomial time, such as (k-)
DOMINATING SET, essentially no better algorithm is presently known than the one which …

Graph theory, a branch of mathematics, studies the relationships between entities using
vertices and edges. Uncertain Graph Theory has emerged within this field to model the …

A graph class consists of graphs that share common structural properties, defined by specific
rules or constraints. This study focuses onEven-Hole-FreeandMeyniel Graphs, analyzed …

The graph sandwich problem for property Π is defined as follows: Given two graphs G1=(V,
E1) and G2=(V, E2) such that E1⊆ E2, is there a graph G=(V, E) such that E1⊆ E⊆ E2 …

The study of algorithmic graph theory and structured families of graphs is an important
branch of discrete mathematics. It finds numerous applications, from data transmission …

Physical map** is a central problem in molecular biology and the human genome project.
The problem is to reconstruct the relative position of fragments of DNA along the genome …