1951 search results - page 62 / 391 » An algorithm for improving graph partitions |
152
click to vote
WABI
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. The orientation of physical networks is a prime task in deciphering the signaling-regulatory circuitry of the cell. One manifestation of this computational task is as a m...
172
click to vote
PVLDB
2010
14 years 10 months ago
2010
We present Schism, a novel workload-aware approach for database partitioning and replication designed to improve scalability of sharednothing distributed databases. Because distri...
244
click to vote
ICDE
2006
IEEE
16 years 5 months ago
2006
IEEE
Efficient indexing techniques have been developed for the exact and approximate substructure search in large scale graph databases. Unfortunately, the retrieval problem of structu...
128
click to vote
ICTCS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We study efficient exact algorithms for several problems including Vertex Bipartization, Feedback Vertex Set, 3-Hitting Set, Max Cut in graphs with maximum degree at most...
110
click to vote
IWPEC
2009
Springer
15 years 10 months ago
2009
Springer
An induced matching in graph G is a matching which is an induced subgraph of G. Clearly, among two vertices with the same neighborhood (called twins) at most one is matched in any...