Search
Search Results
-
Fitch Graph Completion
Horizontal gene transfer is an important contributor to evolution. According to Walter M. Fitch, two genes are xenologs if they are separated by at...
-
Improved Bounds for the Binary Paint Shop Problem
We improve bounds for the binary paint shop problem posed by Meunier and Neveu [Computing solutions of the paintshop-necklace problem. Comput. Oper....
-
Solving Systems of Linear Equations Through Zero Forcing Set
Let \(\mathbb {F}\) be any field, we consider...
-
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\)...
-
Plane Multigraphs with One-Bend and Circular-Arc Edges of a Fixed Angle
For an angle \(\alpha \in (0,\pi )\) , we consider plane graphs and...
-
Canonization of a Random Circulant Graph by Counting Walks
It is well known that almost all graphs are canonizable by a simple combinatorial routine known as color refinement. With high probability, this...
-
-
Szenengraphen
In diesem Kapitel befassen wir uns mit Szenengraphen, einer grundlegenden Datenstruktur, die in der Computeranimation verwendet wird. Sie spielt eine...
-
Motion Capture
Motion Capture bezeichnet Verfahren, mit denen Bewegungen realer Objekte aufgezeichnet werden können. In diesem Kapitel geben wir einen Überblick und...