3204 search results - page 259 / 641 » The b-chromatic Number of a Graph |
100
Voted
GECCO
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. Software clustering techniques are useful for extracting architectural information about a system directly from its source code structure. This paper starts by examining ...
INFOVIS
2000
IEEE
15 years 5 months ago
2000
IEEE
We describe MGV, an integrated visualization and exploration system for massive multi-digraph navigation. MGV’s only assumption is that the vertex set of the underlying digraph ...
101
Voted
GECCO
2008
Springer
15 years 1 months ago
2008
Springer
The aim of process mining is to identify and extract process patterns from data logs to reconstruct an overall process flowchart. As business processes become more and more comple...
120
click to vote
ALGORITHMICA
2010
15 years 27 days ago
2010
Given a 2k-edge-connected undirected graph, we consider to find a minimum cost orientation that yields a k-arc-connected directed graph. This minimum cost k-arc-connected orientat...
83
Voted
DM
2010
15 years 25 days ago
2010
For d 1, s 0 a (d,d +s)-graph is a graph whose degrees all lie in the interval {d,d +1,...,d +s}. For r 1, a 0 an (r,r+1)-factor of a graph G is a spanning (r,r+a)-subgraph of...