Sciweavers

1883 search results - page 116 / 377
» Ordered theta graphs
Sort
View
RSA
2008
125views more  RSA 2008»
13 years 7 months ago
The game chromatic number of random graphs
: Given a graph G and an integer k, two players take turns coloring the vertices of G one by one using k colors so that neighboring vertices get different colors. The first player ...
Tom Bohman, Alan M. Frieze, Benny Sudakov
WG
2010
Springer
13 years 6 months ago
On the Small Cycle Transversal of Planar Graphs
We consider the problem of finding a k-edge transversal set that covers all (simple) cycles of length at most s in a planar graph, where s ≥ 3 is a constant. This problem, refe...
Ge Xia, Yong Zhang
ENTCS
2011
56views more  ENTCS 2011»
13 years 2 months ago
Feynman Graphs, and Nerve Theorem for Compact Symmetric Multicategories (Extended Abstract)
d abstract) Andr´e Joyal 1 D´epartement des math´ematiques Universit´e du Qu´ebec `a Montr´eal Canada Joachim Kock 2 3 Departament de matem`atiques Universitat Aut`onoma de B...
André Joyal, Joachim Kock
ICML
2006
IEEE
14 years 8 months ago
An analysis of graph cut size for transductive learning
I consider the setting of transductive learning of vertex labels in graphs, in which a graph with n vertices is sampled according to some unknown distribution; there is a true lab...
Steve Hanneke
ER
2007
Springer
101views Database» more  ER 2007»
14 years 2 months ago
Using Attributed Goal Graphs for Software Component Selection: An Application of Goal-Oriented Analysis to Decision Making
During software requirements analysis and design steps, developers and stakeholders have many alternatives of artifacts such as software component selection and should make decisi...
Kazuma Yamamoto, Motoshi Saeki