Sciweavers

3204 search results - page 138 / 641
» The Alcuin Number of a Graph
Sort
View
COMBINATORICS
2006
123views more  COMBINATORICS 2006»
13 years 8 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
WORDS
2005
IEEE
14 years 1 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
ECEASST
2010
13 years 5 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»
14 years 8 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
14 years 3 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