686 search results - page 93 / 138 » Packing Cycles in Graphs |
107
Voted
DAM
2010
15 years 22 days 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...
127
Voted
JCT
2006
15 years 18 days 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...
74
Voted
ENDM
2007
15 years 18 days 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...
102
click to vote
ICDM
2003
IEEE
15 years 6 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 ...
77
Voted
KBSE
2003
IEEE
15 years 6 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...