Sciweavers

3204 search results - page 165 / 641
» The Alcuin Number of a Graph
Sort
View
SMA
2003
ACM
118views Solid Modeling» more  SMA 2003»
14 years 1 months ago
Graph based topological analysis of tessellated surfaces
In this paper a graph-based method is presented which not only characterizes topological classification of the tessellated surfaces but also simultaneously generates the substanti...
Tula Ram Ban, Dibakar Sen
COMBINATORICA
2007
119views more  COMBINATORICA 2007»
13 years 7 months ago
Complete partitions of graphs
A complete partition of a graph G is a partition of its vertex set in which any two distinct classes are connected by an edge. Let cp(G) denote the maximum number of classes in a ...
Magnús M. Halldórsson, Guy Kortsarz,...
CORR
2010
Springer
130views Education» more  CORR 2010»
13 years 5 months ago
Oblivious Buy-at-Bulk in Planar Graphs
In the oblivious buy-at-bulk network design problem in a graph, the task is to compute a fixed set of paths for every pair of source-destination in the graph, such that any set of ...
Srinivasagopalan Srivathsan, Costas Busch, S. Sith...
CSL
2011
Springer
13 years 3 months ago
Applications of graph theory to an English rhyming corpus
How much can we infer about the pronunciation of a language – past or present – by observing which words its speakers rhyme? This paper explores the connection between pronunc...
Morgan Sonderegger
SIAMDM
2010
138views more  SIAMDM 2010»
13 years 6 months ago
The Last Fraction of a Fractional Conjecture
Reed conjectured that for every ε > 0 and every integer ∆, there exists g such that the fractional total chromatic number of every graph with maximum degree ∆ and girth at...
Frantisek Kardos, Daniel Král', Jean-S&eacu...