601 search results - page 83 / 121 » Edge-dominating cycles in graphs |
MSR
2006
ACM
15 years 6 months ago
2006
ACM
Files, classes, or methods have frequently been investigated in recent research on co-change. In this paper, we present a first study at the level of lines. To identify line chan...
HICSS
2003
IEEE
15 years 5 months ago
2003
IEEE
Managers and group leaders of a community may not have enough information to help them direct the community development. In this paper, we adopt social network analysis, graph the...
90
Voted
WG
1998
Springer
15 years 4 months ago
1998
Springer
We study the integral uniform (multicommodity) flow problem in a graph G and construct a fractional solution whose properties are invariant under the action of a group of automorp...
106
Voted
DAM
2010
15 years 18 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...
125
Voted
JCT
2006
15 years 14 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...