3268 search results - page 208 / 654 » The hub number of a graph |
187
click to vote
COR
2011
15 years 1 months ago
2011
The purpose of this paper is twofold. First, it explores the issue of producing valid, compact round-robin sports schedules by considering the problem as one of graph colouring. U...
148
click to vote
KDD
2005
ACM
16 years 7 months ago
2005
ACM
We present an algorithm for mining tree-shaped patterns in a large graph. Novel about our class of patterns is that they can contain constants, and can contain existential nodes w...
170
click to vote
ESA
2005
Springer
16 years 3 days ago
2005
Springer
We introduce the Minimum-size bounded-capacity cut (MinSBCC) problem, in which we are given a graph with an identified source and seek to find a cut minimizing the number of node...
214
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs (demands) s1t1, s2t2, . . ., sktk, the goal is to maximize the number ...
144
click to vote
WSC
2007
15 years 9 months ago
2007
Event Graphs (EGs) and Simulation Graph Models provide a powerful and general modeling framework for discrete event simulation. Qualitative Event Graphs (QEGs) extend the EG frame...