417 search results - page 20 / 84 » Constructing Call Multigraphs Using Dependence Graphs |
CORR
2012
Springer
12 years 4 months ago
2012
Springer
We show how to compute cartograms with worst-case optimal polygonal complexity. Specifically we study rectilinear duals which are side-contact representations of a planar graph G ...
ICDE
2003
IEEE
14 years 9 months ago
2003
IEEE
We are witnessing in recent years growing interest for location-dependent information services among mobile users. This paper examines the issue of processing locationdependent qu...
STOC
2005
ACM
14 years 8 months ago
2005
ACM
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...
ICPP
1995
IEEE
14 years 16 hour ago
1995
IEEE
– In this paper we present experiments with a class of graph partitioning algorithms that reduce the size of the graph by collapsing vertices and edges, partition the smaller gra...
SIGSOFT
1994
ACM
14 years 16 days ago
1994
ACM
Program slicing is a fundamental operation for many software engineering tools. Currently, the most efficient algorithm for interprocedural slicing is one that uses a program repr...