1 citations · 3 across the 19 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
cs.CC2018
On the Enumeration and Counting of Bicriteria Temporal Paths
Petra Mutzel, Lutz Oettershagen
We discuss the complexity of path enumeration and counting in weighted temporal graphs. In a weighted temporal graph, each edge has an availability time, a traversal time and some…
cs.CG2018
The Crossing Number of Semi-Pair-Shellable Drawings of Complete Graphs
Petra Mutzel, Lutz Oettershagen
The Harary-Hill Conjecture states that for every drawing of has at least \begin{align*} H(n) := \frac{1}{4}\Big\lfloor\frac{n}{2}\Big\rfloor\Big\lfloor\frac{n-1}{2}…
cs.CG2018
The Crossing Number of Seq-Shellable Drawings of Complete Graphs
Petra Mutzel, Lutz Oettershagen
The Harary-Hill conjecture states that for every the complete graph on vertices , the minimum number of crossings over all its possible drawings equals \begin{align*…