1422 search results - page 4 / 285 » The geometry of graphs and some of its algorithmic applicati... |
SODA
2004
ACM
13 years 8 months ago
2004
ACM
We solve an open problem posed by Eppstein in 1995 [14, 15] and re-enforced by Grohe [16, 17] concerning locally bounded treewidth in minor-closed families of graphs. A graph has ...
FLAIRS
2004
13 years 8 months ago
2004
ABSURDIST II, an extension to ABSURDIST, is an algorithm using attributed graph matching to find translations between conceptual systems. It uses information about the internal st...
COMPGEOM
2010
ACM
14 years 15 days ago
2010
ACM
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
BMCBI
2010
13 years 7 months ago
2010
Background: Clustering the information content of large high-dimensional gene expression datasets has widespread application in "omics" biology. Unfortunately, the under...
KDD
2009
ACM
14 years 8 months ago
2009
ACM
Recently many data types arising from data mining and Web search applications can be modeled as bipartite graphs. Examples include queries and URLs in query logs, and authors and ...