686 search results - page 93 / 138 » Packing Cycles in Graphs |
128
click to vote
DAM
2010
15 years 3 months ago
2010
In the minimum sum edge coloring problem, we aim to assign natural numbers to edges of a graph, so that adjacent edges receive different numbers, and the sum of the numbers assign...
149
click to vote
JCT
2006
15 years 3 months ago
2006
Abstract. We introduce "matroid parse trees" which, using only a limited amount of information at each node, can build up the vector representations of matroids of bounde...
ENDM
2007
15 years 3 months ago
2007
An s-graph is a graph with two kind of edges: subdivisible edges and real edges. A realisation of an s-graph B is any graph obtained by subdividing subdivisible edges of B into pa...
126
Voted
ICDM
2003
IEEE
15 years 8 months ago
2003
IEEE
Learning Bayesian network structure from large-scale data sets, without any expertspecified ordering of variables, remains a difficult problem. We propose systematic improvements ...
102
click to vote
KBSE
2003
IEEE
15 years 8 months ago
2003
IEEE
We propose a practical parallel on-the-fly algorithm for enumerative LTL model-checking. The algorithm is designed for a cluster of workstations communicating via MPI. The detect...