Sciweavers

1297 search results - page 2 / 260
» fews 2007
Sort
View
DMTCS
2007
91views Mathematics» more  DMTCS 2007»
14 years 11 months ago
Complexity Results on Graphs with Few Cliques
Bill Rosgen, Lorna Stewart
STOC
2007
ACM
82views Algorithms» more  STOC 2007»
16 years 9 hour ago
Interval completion with few edges
Pinar Heggernes, Christophe Paul, Jan Arne Telle, ...
APN
2007
Springer
15 years 5 months ago
From Many Places to Few: Automatic Abstraction Refinement for Petri Nets
Pierre Ganty, Jean-François Raskin, Laurent...
COMGEO
2007
ACM
14 years 11 months ago
Configurations with few crossings in topological graphs
Christian Knauer, Étienne Schramm, Andreas ...
ARSCOM
2004
104views more  ARSCOM 2004»
14 years 11 months ago
Complete Minors in Cubic Graphs with few short Cycles and Random Cubic Graphs
We first prove that for any fixed k a cubic graph with few short cycles contains a Kk-minor. This is a direct generalisation of a result on girth by Thomassen. We then use this the...
Klas Markstrom