Sciweavers

3204 search results - page 240 / 641
» The b-chromatic Number of a Graph
Sort
View
PDP
2005
IEEE
15 years 6 months ago
Practicable Layouts for Optimal Circulant Graphs
Circulant graphs have been deeply studied in technical literature. Midimew networks are a class of distancerelated optimal circulant graphs of degree four which have applications ...
Enrique Vallejo, Ramón Beivide, Carmen Mart...
101
Voted
VLDB
2005
ACM
144views Database» more  VLDB 2005»
15 years 6 months ago
Bidirectional Expansion For Keyword Search on Graph Databases
Relational, XML and HTML data can be represented as graphs with entities as nodes and relationships as edges. Text is associated with nodes and possibly edges. Keyword search on s...
Varun Kacholia, Shashank Pandit, Soumen Chakrabart...
CP
2004
Springer
15 years 6 months ago
How Much Backtracking Does It Take to Color Random Graphs? Rigorous Results on Heavy Tails
Many backtracking algorithms exhibit heavy-tailed distributions, in which their running time is often much longer than their median. We analyze the behavior of two natural variant...
Haixia Jia, Cristopher Moore
DASFAA
2010
IEEE
224views Database» more  DASFAA 2010»
15 years 5 months ago
Dynamic Skyline Queries in Large Graphs
Given a set of query points, a dynamic skyline query reports all data points that are not dominated by other data points according to the distances between data points and query po...
Lei Zou, Lei Chen 0002, M. Tamer Özsu, Dongya...
90
Voted
ISAAC
1998
Springer
94views Algorithms» more  ISAAC 1998»
15 years 4 months ago
Two-Layer Planarization in Graph Drawing
Abstract. We study the two-layer planarization problems that have applications in Automatic Graph Drawing. We are searching for a two-layer planar subgraph of maximumweight in a gi...
Petra Mutzel, René Weiskircher