Sciweavers

3204 search results - page 103 / 641
» The b-chromatic Number of a Graph
Sort
View
AINA
2008
IEEE
14 years 4 days ago
Formalization of Link Farm Structure Using Graph Grammar
A link farm is a set of web pages constructed to mislead the importance of target pages in search engine results by boosting their link-based ranking scores. In this paper, we int...
Kiattikun Chobtham, Athasit Surarerks, Arnon Rungs...
SODA
2008
ACM
70views Algorithms» more  SODA 2008»
13 years 11 months ago
Optimal universal graphs with deterministic embedding
Let H be a finite family of graphs. A graph G is H-universal if it contains a copy of each H H as a subgraph. Let H(k, n) denote the family of graphs on n vertices with maximum d...
Noga Alon, Michael R. Capalbo
ALGORITHMICA
2007
82views more  ALGORITHMICA 2007»
13 years 10 months ago
Rigid Components in Molecular Graphs
In this paper we consider 3-dimensional generic bar-and-joint realizations of squares of graphs. These graphs are also called molecular graphs due to their importance in the study...
Bill Jackson, Tibor Jordán
ARSCOM
2007
91views more  ARSCOM 2007»
13 years 10 months ago
Zero-Sum Magic Graphs And Their Null Sets
For any h ∈ N, a graph G = (V, E) is said to be h-magic if there exists a labeling l : E(G) → Zh − {0} such that the induced vertex labeling l+ : V (G) → Zh defined by l+ ...
Ebrahim Salehi
CPC
2008
51views more  CPC 2008»
13 years 10 months ago
Winning Fast in Sparse Graph Construction Games
A Graph Construction Game is a Maker-Breaker game. Maker and Breaker take turns in choosing previously unoccupied edges of the complete graph KN . Maker's aim is to claim a c...
Ohad N. Feldheim, Michael Krivelevich