Sciweavers

134 search results - page 11 / 27
» A note on generalized chromatic number and generalized girth
Sort
View
ENDM
2010
87views more  ENDM 2010»
13 years 7 months ago
Euler Complexes (Oiks)
We present a class of instances of the existence of a second object of a specified type, in fact, of an even number of objects of a specified type, which generalizes the existence...
Jack Edmonds
STOC
2005
ACM
135views Algorithms» more  STOC 2005»
14 years 8 months ago
Quadratic forms on graphs
We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...
Noga Alon, Konstantin Makarychev, Yury Makarychev,...
CCR
2010
81views more  CCR 2010»
13 years 7 months ago
Internet requests for comments (RFCs) as scholarly publications
This note describes the various peer review processes applied to Internet Requests for Comments (RFCs) over a number of years, and suggests that these have been up to normal schol...
Brian E. Carpenter, Craig Partridge
DM
2010
103views more  DM 2010»
13 years 7 months ago
Rainbow paths
A k-rainbow path in a graph with colored edges is a path of length k where each edge has a different color. In this note, we settle the problem of obtaining a constructive k-colori...
Domingos Dellamonica Jr., Colton Magnant, Daniel M...
CORR
2010
Springer
162views Education» more  CORR 2010»
13 years 4 months ago
Cross-Composition: A New Technique for Kernelization Lower Bounds
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...
Hans L. Bodlaender, Bart M. P. Jansen, Stefan Krat...