Sciweavers

601 search results - page 83 / 121
» Edge-dominating cycles in graphs
Sort
View
MSR
2006
ACM
14 years 2 months ago
Mining version archives for co-changed lines
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...
Thomas Zimmermann, Sunghun Kim, Andreas Zeller, E....
HICSS
2003
IEEE
167views Biometrics» more  HICSS 2003»
14 years 1 months ago
Discovering Group Interaction Patterns in a Teachers Professional Community
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...
Fu-ren Lin, Chun-Hung Chen, Kuo-Lung Tsai
WG
1998
Springer
14 years 26 days ago
Integral Uniform Flows in Symmetric Networks
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...
Farhad Shahrokhi, László A. Sz&eacut...
DAM
2010
116views more  DAM 2010»
13 years 8 months ago
Minimum sum edge colorings of multicycles
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...
Jean Cardinal, Vlady Ravelomanana, Mario Valencia-...
JCT
2006
110views more  JCT 2006»
13 years 8 months ago
Branch-width, parse trees, and monadic second-order logic for matroids
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...
Petr Hlinený