72 citations · 218 across the 15 of their papers we have counts for
Showing 2002 · cs.DSShow all
2 papers · 2 filters
cs.DS2002
Dynamic Generators of Topologically Embedded Graphs
David Eppstein
We provide a data structure for maintaining an embedding of a graph on a surface (represented combinatorially by a permutation of edges around each vertex) and computing generators…
cs.DS2002
Algorithms for Media
David Eppstein, Jean-Claude Falmagne
Falmagne recently introduced the concept of a medium, a combinatorial object encompassing hyperplane arrangements, topological orderings, acyclic orientations, and many other famil…