1 citations · 1 across the 2 of their papers we have counts for
5 papers
Language-Representability: Possibilities and Limitations
Zhidan Feng, Henning Fernau, Pamela Fleischmann +2
The study of word-representability was initiated by the seminal work of Kitaev and Pyatkin in 2008 that has later led to the monograph by Kitaev and Lozin in 2015. In this paper, w…
Determining Factorial Speed Fast
Zhidan Feng, Henning Fernau, Pamela Fleischmann +2
The speed of a graph class measures how many labeled graphs on vertices one can find in . This graph class complexity function is explicitly provided on graphc…
Generalized Word-Representable Graphs
Zhidan Feng, Henning Fernau, Pamela Fleischmann +2
The literature on word-representable graphs is quite rich, and a number of variations of the original definition have been proposed over the years. We are initiating a systematic s…
Enumerating Minimal Defensive Alliances
Zhidan Feng, Henning Fernau, Kevin Mann
In this paper, we study the task of enumerating (and counting) locally and globally minimal defensive alliances in graphs. We consider general graphs as well as special graph class…
Optimal Bridge, Twin Bridges and Beyond: Inserting Edges into a Road Network to Minimize the Constrained Diameters
Zhidan Feng, Henning Fernau, Binhai Zhu
Given a road network modelled as a planar straight-line graph with , let , the shortest path (distance) between is denoted as …