3268 search results - page 122 / 654 » The hub number of a graph |
163
click to vote
LCTRTS
2007
Springer
16 years 17 days ago
2007
Springer
Existing methods place data or code in scratchpad memory, i.e., SPM by either relying on heuristics or resorting to integer programming or mapping it to a graph coloring problem. ...
201
click to vote
WADS
2007
Springer
16 years 16 days ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
167
click to vote
ESA
1999
Springer
15 years 10 months ago
1999
Springer
We propose a fast methodology for encoding graphs with information-theoretically minimum numbers of bits. Specifically, a graph with property π is called a π-graph. If π satis...
152
click to vote
GBRPR
2007
Springer
16 years 17 days ago
2007
Springer
The traveling salesperson problem (TSP) is difficult to solve for input instances with large number of cities. Instead of finding the solution of an input with a large number of c...
182
click to vote
AINA
2009
IEEE
16 years 1 months ago
2009
IEEE
—In this paper we introduce the notion of protein interaction network. This is a graph whose vertices are the protein’s amino acids and whose edges are the interactions between...