882 search results - page 98 / 177 » On the Hardness of Graph Isomorphism |
KDD
2009
ACM
14 years 3 months ago
2009
ACM
There is a growing wealth of data describing networks of various types, including social networks, physical networks such as transportation or communication networks, and biologic...
PODC
2006
ACM
14 years 2 months ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
COMPGEOM
2010
ACM
14 years 1 months 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...
GD
2006
Springer
14 years 13 days ago
2006
Springer
Graph drawing software are now commonly used. However, the choice of a well-adapted program may be hard for an inexperienced user. This poster presents a website (http://www.polyte...
KDD
2008
ACM
14 years 9 months ago
2008
ACM
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...