Search
Search Results
-
Bridging directed acyclic graphs to linear representations in linear genetic programming: a case study of dynamic scheduling
Linear genetic programming (LGP) is a genetic programming paradigm based on a linear sequence of instructions being executed. An LGP individual can...
-
Building Multiple Classifier Systems Using Linear Combinations of Reduced Graphs
Despite great efforts done in research in the last decades, the classification of general graphs, i.e., graphs with unconstrained labeling and...
-
Linear Layouts of Bipartite Planar Graphs
A linear layout of a graph G consists of a linear order, \(\prec \)...
-
Extending Partial Representations of Circle Graphs in Near-Linear Time
The partial representation extension problem generalizes the recognition problem for geometric intersection graphs. The input consists of a graph G ,...
-
Linear Time Algorithms for NP-Hard Problems Restricted to GaTEx Graphs
The class of Galled-Tree Explainable (GaTEx) graphs has just recently been discovered as a natural generalization of cographs. Cographs are precisely...
-
Computing Bend-Minimum Orthogonal Drawings of Plane Series–Parallel Graphs in Linear Time
A planar orthogonal drawing of a planar 4-graph G (i.e., a planar graph with vertex-degree at most four) is a crossing-free drawing that maps each...
-
-
Min Orderings and List Homomorphism Dichotomies for Graphs and Signed Graphs
Since the CSP dichotomy conjecture has been established, a number of other dichotomy questions have attracted interest, including one for list...
-
-
The Complexity of Routing Problems in Forbidden-Transition Graphs and Edge-Colored Graphs
The notion of forbidden-transition graphs allows for a robust generalization of walks in graphs. In a forbidden-transition graph, every pair of edges...
-
Two-Step Coloring of Grid Graphs of Different Types
AbstractIn this article, we consider the NP-hard problem of the two-step coloring of a graph. It is required to color the graph in the given number...
-
Paired restraint domination in extended supergrid graphs
Consider a graph G with vertex set V ( G ) and edge set E ( G ). A subset D of V ( G ) is said to be a dominating set of G if every vertex not in D is...
-
The Rique-Number of Graphs
We continue the study of linear layouts of graphs in relation to known data structures. At a high level, given a data structure, the goal is to find...
-
Sequent Systems on Undirected Graphs
In this paper we explore the design of sequent calculi operating on graphs. For this purpose, we introduce logical connectives allowing us to extend...
-
Recognizing Map Graphs of Bounded Treewidth
A map is a partition of the sphere into interior-disjoint regions homeomorphic to closed disks. Some regions are labeled as nations, while the...
-
On Star Partition of Split Graphs
A graph that is isomorphic to \(K_{1,r}\) for...
-
Algorithms and Complexity on Indexing Founder Graphs
We study the problem of matching a string in a labeled graph. Previous research has shown that unless the Orthogonal Vectors Hypothesis (OVH) is...
-
Pebbling in Kneser Graphs
Graph pebbling is a game played on graphs with pebbles on their vertices. A pebbling move removes two pebbles from one vertex and places one pebble...
-
Parity Games on Temporal Graphs
Temporal graphs are a popular modelling mechanism for dynamic complex systems that extend ordinary graphs with discrete time. Simply put, time...
-
Efficient algorithms for reachability and path queries on temporal bipartite graphs
Bipartite graphs are naturally used to model relationships between two types of entities, such as people-location, user-post, and investor-stock....
