3105 search results - page 136 / 621 » The Path-Packing Structure of Graphs |
162
click to vote
LCTRTS
2007
Springer
16 years 15 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. ...
198
click to vote
WADS
2007
Springer
16 years 14 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...
235
click to vote
WG
2010
Springer
15 years 4 months ago
2010
Springer
book Author Title 58 Bijo S Anand Atoms and clique separators in graph products 59 Asir T Domination in total graph of a commutative ring 60 Sharada B On the Neighbourhood Subdivi...
174
click to vote
ISAAC
2004
Springer
15 years 11 months ago
2004
Springer
Let G be a graph containing N disjoint t-spanners that are inter-connected with M edges. We present an algorithm that constructs a data structure of size O(M2 + n log n) that answ...
167
click to vote
ACL
2007
15 years 7 months ago
2007
This paper describes a new method for computing lexical chains. These are sequences of semantically related words that reflect a text’s cohesive structure. In contrast to previo...