Sciweavers

725 search results - page 21 / 145
» Bounding Degrees on RPL
Sort
View
DM
2006
77views more  DM 2006»
14 years 9 months ago
Strong edge-coloring of graphs with maximum degree 4 using 22 colors
In 1985, Erdos and Ne
Daniel W. Cranston
CORR
2006
Springer
166views Education» more  CORR 2006»
14 years 9 months ago
Bounding the Bias of Tree-Like Sampling in IP Topologies
Abstract. It is widely believed that the Internet's AS-graph degree distribution obeys a power-law form. However, it was recently argued that since Internet data is collected ...
Reuven Cohen, Mira Gonen, Avishai Wool
COLING
2010
14 years 4 months ago
Normal-form parsing for Combinatory Categorial Grammars with generalized composition and type-raising
We propose and implement a modification of the Eisner (1996) normal form to account for generalized composition of bounded degree, and an extension to deal with grammatical type-r...
Julia Hockenmaier, Yonatan Bisk
JDA
2010
122views more  JDA 2010»
14 years 4 months ago
Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs
We present subexponential parameterized algorithms on planar graphs for a family of problems of the following shape: given a graph, find a connected (induced) subgraph with bounde...
Ignasi Sau, Dimitrios M. Thilikos
JGT
2010
152views more  JGT 2010»
14 years 4 months ago
Cycles of even lengths modulo k
Thomassen [9] conjectured that for all natural numbers k > 0 and m, every graph of minimum degree k + 1 contains a cycle of length congruent to 2m modulo k. We prove that this ...
Ajit A. Diwan