3267 search results - page 97 / 654 » Generalized quasirandom graphs |
123
click to vote
STOC
2010
ACM
15 years 5 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
108
click to vote
BMCBI
2008
15 years 1 months ago
2008
Background: Graphs and networks are common analysis representations for biological systems. Many traditional graph algorithms such as k-clique, k-coloring, and subgraph matching h...
157
click to vote
TKDE
2011
14 years 7 months ago
2011
—This work introduces a link-analysis procedure for discovering relationships in a relational database or a graph, generalizing both simple and multiple correspondence analysis. ...
GC
2010
Springer
14 years 11 months ago
2010
Springer
Intriguing and tight sets of vertices of point-line geometries have recently been studied in the literature. In this paper, we indicate a more general framework for dealing with t...
110
click to vote
WG
2004
Springer
15 years 6 months ago
2004
Springer
In portable multimedia systems a number of communicating tasks has to be performed on a set of heterogeneous processors. This should be done in an energy-efficient way. We give th...