Sciweavers

3268 search results - page 283 / 654
» The hub number of a graph
Sort
View
OOPSLA
2000
Springer
15 years 10 months ago
Scalable propagation-based call graph construction algorithms
Propagation-based call graph construction algorithms have been studied intensively in the 1990s, and differ primarily in the number of sets that are used to approximate run-time v...
Frank Tip, Jens Palsberg
KRDB
1998
83views Database» more  KRDB 1998»
15 years 8 months ago
Semantic Query Optimisation and Rule Graphs
Previous researchers note the problem for semantic optimisation of database queries caused by its production of a large number of semantically equivalent alternative queries, from...
Jerome Robinson, Barry G. T. Lowden
JEI
2006
82views more  JEI 2006»
15 years 6 months ago
Real-time mosaic using sequential graph
To prevent large error accumulation in multiple image registration considering real-time applications, we propose a new fast global mosaic method using sequential block matching in...
Dae Woong Kim, Ki-Sang Hong
167
Voted
ALGORITHMICA
2004
111views more  ALGORITHMICA 2004»
15 years 6 months ago
Automated Generation of Search Tree Algorithms for Hard Graph Modification Problems
We present a framework for an automated generation of exact search tree algorithms for NP-hard problems. The purpose of our approach is two-fold--rapid development and improved up...
Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Nie...
SIAMDM
2010
114views more  SIAMDM 2010»
15 years 5 months ago
Rank-Based Attachment Leads to Power Law Graphs
Abstract. We investigate the degree distribution resulting from graph generation models based on rank-based attachment. In rank-based attachment, all vertices are ranked according ...
Jeannette Janssen, Pawel Pralat