37 search results - page 5 / 8 » On the Number of Genus One Labeled Circle Trees |
155
click to vote
GECCO
2007
Springer
16 years 5 days ago
2007
Springer
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
147
click to vote
WAOA
2005
Springer
15 years 11 months ago
2005
Springer
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...
192
click to vote
SIAMDM
2010
15 years 23 days ago
2010
Abstract. Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not in...
177
click to vote
PR
2008
15 years 6 months ago
2008
The spectrum of a graph has been widely used in graph theory to characterise the properties of a graph and extract information from its structure. It has also been employed as a g...
174
click to vote
WWW
2005
ACM
16 years 6 months ago
2005
ACM
This paper studies the problem of extracting data from a Web page that contains several structured data records. The objective is to segment these data records, extract data items...