Search
Search Results
-
Minimizing Distances Between Vertices and Edges Through Tree t-Spanners
A tree t-spanner of a graph G is a spanning tree T of G in which any two adjacent vertices of G have distance at most t in T. We say that G is...
-
Enumerating Minimal Vertex Covers and Dominating Sets with Capacity and/or Connectivity Constraints
In this paper, we consider the problems of enumerating minimal vertex covers and minimal dominating sets with capacity and/or connectivity...
-
Resolving Unresolved Resolved and Unresolved Triplets Consistency Problems
The \(\mathcal {R}^{+-} \mathcal {F}^{+-}\) Consistency...
-
Output-Sensitive Enumeration of Potential Maximal Cliques in Polynomial Space
A set of vertices in a graph forms a potential maximal clique if there exists a minimal chordal completion in which it is a maximal clique. Potential...
-
Resolving Sets in Temporal Graphs
A resolving set R in a graph G is a set of vertices such that every vertex of G is uniquely identified by its distances to the vertices of R....
-
Approximate Cycle Double Cover
The Cycle double cover (CDC) conjecture states that for every bridgeless graph G, there exists a family...
-
Parameterized Complexity of Paired Domination
The Paired Domination problem is one of the well-studied variants of the classical Dominating Set problem. In a graph G on n vertices, a dominating...
-
An Improved Bound for Equitable Proper Labellings
For every graph G with size m and no connected component isomorphic to \(K_2\)...
-
Graph Clustering Through Users’ Properties and Social Influence
Clustering is a basic technology in data mining, and similarity measurement plays a crucial role in it. The existing clustering algorithms,...
-
Improved Approximation for Broadcasting in k-Path Graphs
Broadcasting is an information dissemination primitive where a message is passed from one node (called originator) to all other nodes in the network....
-
Erstellen einfacher Grafiken
In diesem Kapitel werden wir die einfachsten Möglichkeiten beschreiben, Grafiken mit dem Package Plots.jl zu erstellen. Neben der Darstellung fester...
-
Vektorfelder, 3D-Plots, Oberflächen und Niveaulinien
Diese Kapitel deckt die Erstellung von Vektorfeldern, parametrischen Kurven, Oberflächen sowie Niveaulinien ab. Zusätzlich werden die...
-
Interaktive Anwendungen und Animationen
Bisher haben wir lediglich statische Grafiken betrachtet. In diesem Kapitel soll nun das Handwerkszeug zum Erstellen interaktiver Grafiken...
-
Reconfiguration of Multisets with Applications to Bin Packing
We use the reconfiguration framework to analyze problems that involve the rearrangement of items among groups. In various applications, a group of...
-
Efficient Enumeration of Drawings and Combinatorial Structures for Maximal Planar Graphs
We propose efficient algorithms for enumerating the celebrated combinatorial structures of maximal planar graphs, called canonical orderings and...
-
Reasons to Fall (More) in Love with Combinatorial Reconfiguration
The goal of the talk is to give ideas and inspiration to everyone in the audience, whether currently working in combinatorial reconfiguration or new...
-
Simultaneous Drawing of Layered Trees
We study the crossing-minimization problem in a layered graph drawing of planar-embedded rooted trees whose leaves have a given total order on the...
-
Stable and Dynamic Minimum Cuts
We consider the problems of maintaining exact minimum cuts and \(\rho \)...
-
Black Hole Search in Dynamic Cactus Graph
We study the problem of black hole search by a set of mobile agents, where the underlying graph is a dynamic cactus. A black hole is a dangerous...
-
On the Complexity of List \(\mathcal H\) -Packing for Sparse Graph Classes
The problem of packing as many subgraphs isomorphic to \(H \in \mathcal H\)...