402 search results - page 12 / 81 » On Finding the Number of Graph Automorphisms |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Given a directed acyclic graph with labeled vertices, we consider the problem of finding the most common label sequences ("traces") among all paths in the graph (of some...
SIAMDM
2008
13 years 7 months ago
2008
We consider the problem of assigning a numerical channel to each transmitter in a large regular array such that multiple levels of interference, which depend on the distance betwe...
COMPGEOM
2010
ACM
14 years 21 days ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
ICDE
2007
IEEE
14 years 9 months ago
2007
IEEE
It is widely realized that the integration of database and information retrieval techniques will provide users with a wide range of high quality services. In this paper, we study ...
SPAA
2005
ACM
14 years 1 months ago
2005
ACM
In 1995, Gremban, Miller, and Zagha introduced supporttree preconditioners and a parallel algorithm called supporttree conjugate gradient (STCG) for solving linear systems of the ...