Abstract—Comparing graphs to determine the level of underlying structural similarity between them is a widely encountered problem in computer science. It is particularly relevant...
Damien Fay, Hamed Haddadi, Andrew Thomason, Andrew...
Most Internet measurement studies utilize traceroute-collected path traces to build Internet maps. In this paper, we measure the impact of alias resolution problem on Internet topo...
Mehmet Hadi Gunes, Nicolas Sanchis Nielsen, Kamil ...
We revisit the problem of computing the topology and geometry of a real algebraic plane curve. The topology is of prime interest but geometric information, such as the position of...
Jinsan Cheng, Sylvain Lazard, Luis Mariano Pe&ntil...
We revisit the problem of computing the topology and geometry of a real algebraic plane curve. The topology is of prime interest but geometric information, such as the position of...
Jinsan Cheng, Sylvain Lazard, Luis Mariano Pe&ntil...
The dynamic topological order problem is that of efficiently updating a topological order after some edge(s) are inserted into a graph. Much prior work exists on the unit-change v...