Suchergebnisse - "Journal of graph algorithms and applications"

Parameterized Algorithms for Book Embedding Problems von Bhore, Sujoy, Ganian, Robert, Montecchiani, Fabrizio, Nöllenburg, Martin

“… A $k$-page book embedding of a graph $G$ draws the vertices of $G$ on a line and the edges on $k$ half-planes (called pages) bounded by this line, such that no …”
Volltext

Parameterized Complexity of Geodetic Set von Kellerhals, Leon, Koana, Tomohiro

“… A vertex set $S$ of a graph $G$ is geodetic if every vertex of $G$ lies on a shortest path between two vertices in $S$. Given a graph $G$ and $k \in …”
Volltext

Parameterized Algorithms for Queue Layouts von Bhore, Sujoy, Ganian, Robert, Montecchiani, Fabrizio, Nöllenburg, Martin

“… An $h$-queue layout of a graph $G$ consists of a linear order of its vertices and a partition of its edges into $h$ sets, called queues, such that no two …”
Volltext

Graph Matching Based on Similarities in Structure and Attributes von Candelier, Raphaël

“… Finding vertex-to-vertex correspondences in real-world graphs is a challenging task with applications in a wide variety of domains. Structural matching based …”
Volltext

Holes in Convex and Simple Drawings von Bergold, Helena, Orthaber, Joachim, Scheucher, Manfred, Schröder, Felix

“… Gons and holes in point sets have been extensively studied in the literature. For simple drawings of the complete graph a generalization of the …”
Volltext

On k-planar Graphs without Short Cycles von Bekos, Michael A., Bose, Prosenjit, Büngener, Aaron, Dujmovi´c, Vida, Hoffmann, Michael, Kaufmann, Michael, Morin, Pat, Odak, Saeed, Weinberger, Alexandra

“… We study the impact of forbidding short cycles to the edge density of k-planar graphs; a k-planar graph is one that can be drawn in the plane with at most k …”
Volltext

New Reducible Configurations for Graph Multicoloring with Application to the Experimental Resolution of McDiarmid-Reed's Conjecture von Godin, Jean-Christophe, Togni, Olivier

“… A $(a,b)$-coloring of a graph $G$ associates to each vertex a $b$-subset of a set of $a$ colors in such a way that the color-sets of adjacent vertices are …”
Volltext

Finding Near-Optimal Weight Independent Sets at Scale von Großmann, Ernestine, Lamm, Sebastian, Schulz, Christian, Strash, Darren

“… Computing maximum weight independent sets in graphs is an important NP-hard optimization problem. The problem is particularly difficult to solve in large …”
Volltext

On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges von Binucci, Carla, Liotta, Giuseppe, Montecchiani, Fabrizio, Ortali, Giacomo, Piselli, Tommaso

“… Orienting the edges of an undirected graph such that the resulting digraph satisfies some given constraints is a classical problem in graph theory, with …”
Volltext

Quantum Graph Drawing von Caroppo, Susanna, Da Lozzo, Giordano, Di Battista, Giuseppe

“… In this paper, we initiate the study of quantum algorithms in the Graph Drawing research area. We focus on two foundational drawing standards: 2-level drawings …”
Volltext

A Census of Graph-Drawing Algorithms Based on Generalized Transversal Structures von Bernardi, Olivier, Fusy, Eric, Liang, Shizhe

“… We present two graph drawing algorithms based on the recently defined "grand-Schnyder woods", which are a far-reaching generalization of the classical Schnyder …”
Volltext

Scalable Algorithms for 2-Packing Sets on Arbitrary Graphs von Borowitz, Jannick, Großmann, Ernestine, Schulz, Christian, Schweisgut, Dominik

“… A 2-packing set for an undirected graph $G=(V,E)$ is defined as a subset $\mathcal{S}\subseteq V$ such that for each pair of vertices $v_1 \neq v_2 \in …”
Volltext

Deciding the Feasibility and Minimizing the Height of Tangles von Firman, Oksana, Kindermann, Philipp, Klemz, Boris, Ravsky, Alexander, Wolff, Alexander, Zink, Johannes

“… We study the following combinatorial problem. Given a set of $n$ y-monotone Jordan curves, called wires, a tangle determines the order of the wires on a number …”
Volltext

Broadcast Schemes of Hypercubes von Fakharan, Mohammadhossein, Harutyunyan, Hovhannes A., Alikhanifard, Pouria

“… Broadcasting is a fundamental process in network communication, modeled as the dissemination of information across vertices in a graph. This paper investigates …”
Volltext

Special Issue on Selected Papers from the 18th International Conference and Workshops on Algorithms and Computation (WALCOM 2024): Guest Editors' Foreword von Uehara, Ryuhei, Yamanaka, Katsuhisa, Yen, Hsu-Chun

“… Special Issue on Selected Papers from the 18th International Conference and Workshops on Algorithms and Computation (WALCOM 2024): Guest Editors' Foreword …”
Volltext

Exact and Approximate Hierarchical Hub Labeling von Cauvi, Justine, Li, Ruoying, Storandt, Sabine

“… Hub Labeling (HL) is a state-of-the-art technique for accelerating shortest path computation in road networks. By utilizing precomputed node labels, it can …”
Volltext

Efficient Enumeration of Drawings and Combinatorial Structures for Maximal Planar Graphs von Da Lozzo, Giordano, Di Battista, Giuseppe, Frati, Fabrizio, Grosso, Fabrizio, Patrignani, Maurizio

“… We propose efficient algorithms for enumerating the notorious combinatorial structures of maximal planar graphs, called canonical orderings and Schnyder woods, …”
Volltext

Searching for a Black Hole in a Dynamic Cactus von Bhattacharya, Adri, Italiano, Giuseppe F., Mandal, Partha Sarathi

“… In this paper, we study the problem of black hole search by a team of mobile agents. A black hole is a dangerous stationary node in a graph that eliminates any …”
Volltext

Constrained Planarity in Practice -- Engineering the Synchronized Planarity Algorithm von Fink, Simon Dominik, Rutter, Ignaz

“… In the constrained planarity setting, we ask whether a graph admits a planar drawing that additionally satisfies a given set of constraints. These constraints …”
Volltext

Parameterized Complexity of 1-Planarity von Bannister, Michael, Cabello, Sergio, Eppstein, David

“… We consider the problem of drawing graphs with at most one crossing per edge. These drawings, and the graphs that can be drawn in this way, are called …”
Volltext