Sciweavers

3204 search results - page 138 / 641
» The Alcuin Number of a Graph
Sort
View
104
Voted
COMBINATORICS
2006
123views more  COMBINATORICS 2006»
14 years 11 months ago
The Non-Crossing Graph
Two sets are non-crossing if they are disjoint or one contains the other. The noncrossing graph NCn is the graph whose vertex set is the set of nonempty subsets of [n] = {1, . . ....
Nathan Linial, Michael E. Saks, David Statter
100
Voted
WORDS
2005
IEEE
15 years 4 months ago
A Graph-Based Model for Component-Based Software Development
Software metrics can be used to objectively quantify the quality of software components and systems, alleviating quality and risk concerns and raising assurance in component-based...
Sahra Sedigh-Ali, Arif Ghafoor
94
Voted
ECEASST
2010
14 years 8 months ago
Checking Graph-Transformation Systems for Confluence
d Abstract) Detlef Plump Abstract. In general, it is undecidable whether a terminating graphtransformation system is confluent or not. We introduce the class of coverable hypergrap...
Detlef Plump
KDD
2008
ACM
147views Data Mining» more  KDD 2008»
15 years 11 months ago
Mobile call graphs: beyond power-law and lognormal distributions
We analyze a massive social network, gathered from the records of a large mobile phone operator, with more than a million users and tens of millions of calls. We examine the distr...
Mukund Seshadri, Sridhar Machiraju, Ashwin Sridhar...
FOCS
2009
IEEE
15 years 5 months ago
Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size
— Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities...
Ankur Moitra