Sciweavers

945 search results - page 19 / 189
» Graph Types
Sort
View
SWAT
1994
Springer
86views Algorithms» more  SWAT 1994»
15 years 5 months ago
Sequential and Parallel Algorithms for Embedding Problems on Classes of Partial k-Trees
We present sequential and parallel algorithms for various embedding problems on bounded degree partial k-trees and k-connected partial k-trees these include subgraph isomorphism a...
Arvind Gupta, Naomi Nishimura
EJC
2006
15 years 1 months ago
3-star factors in random d-regular graphs
The small subgraph conditioning method first appeared when Robinson and the second author showed the almost sure hamiltonicity of random d-regular graphs. Since then it has been u...
Hilda Assiyatun, Nicholas C. Wormald
COSIT
2009
Springer
165views GIS» more  COSIT 2009»
15 years 8 months ago
To Be and Not To Be: 3-Valued Relations on Graphs
Spatial information requires models which allow us to answer ‘maybe’ to questions asking whether a location lies within a region. At the same time, models must account for data...
John G. Stell
91
Voted
STOC
1993
ACM
109views Algorithms» more  STOC 1993»
15 years 5 months ago
Routing permutations on graphs via matchings
We consider a class of routing problems on connected graphs G. Initially, each vertex v of G is occupied by a “pebble” which has a unique destination π(v) in G (so that π is...
Noga Alon, Fan R. K. Chung, Ronald L. Graham
IJCBDD
2010
127views more  IJCBDD 2010»
15 years 6 days ago
Predicting protein complexes by data integration of different types of interactions
: The explosion of highthroughput interaction data from proteomics studies gives us the opportunity to integrate Protein-Protein Interactions (PPI) from different type of interacti...
Powell Patrick Cheng Tan, Daryanaz Dargahi, Freder...