Matroid - PDFSEARCH.IO - Document Search Engine

Matroid
Results: 395

#	Item
241	Efficient Influence Maximization in Social Networks Wei Chen Microsoft Research Asia Beijing, China Add to Reading List Source URL: snap.stanford.edu Language: English - Date: 2011-11-19 02:38:23 NP-complete problems Matroid theory Combinatorial optimization Graph coloring Network theory Shortest path problem Algorithm Randomized algorithm Greedy algorithm Mathematics Theoretical computer science Graph theory
242	CELF++: Optimizing the Greedy Algorithm for Influence Maximization in Social Networks Amit Goyal Wei Lu Add to Reading List Source URL: snap.stanford.edu Language: English - Date: 2012-10-24 23:55:15 Algorithm Heuristic function Submodular set function Applied mathematics Mathematics Greedy algorithm Matroid theory
243	doi:[removed]j.socnet[removed] Add to Reading List Source URL: snap.stanford.edu Language: English - Date: 2011-11-19 02:38:27 Signed graph Partition Matrix Modular representation theory Block matrix Statistical hypothesis testing Social network analysis Anuška Ferligoj Group Mathematics Algebra Matroid theory
244	Exploiting Longer Cycles for Link Prediction in Signed Networks ∗ Kai-Yang Chiang UT Austin Add to Reading List Source URL: snap.stanford.edu Language: English - Date: 2012-10-09 01:03:18 Matroid theory Algebraic graph theory Signed graph NP-complete problems Graph Adjacency matrix Hamiltonian path Connectivity Degree Graph theory Mathematics Theoretical computer science
245	The expansion of random regular graphs David Ellis Introduction Our aim is now to show that for any d ≥ 3, almost all d-regular graphs on {1, 2, . . . , n} have edge-expansion ratio at least cd d (if nd is even), where Add to Reading List Source URL: snap.stanford.edu Language: English - Date: 2012-10-02 14:35:23 Random regular graph Matroid theory Graph Connectivity Regular graph Pseudoforest Line graph Graph theory Mathematics Random graphs
246	PDF Document Add to Reading List Source URL: snap.stanford.edu Language: English - Date: 2012-09-27 02:21:55 Random graphs Graph Planar separator theorem Crossing number Graph theory Mathematics Matroid theory
247	Incremental Dynamic Controllability Revisited Mikael Nilsson and Jonas Kvarnstr¨om and Patrick Doherty Department of Computer and Information Science Link¨oping University, SE[removed]Link¨oping, Sweden {mikni,jonkv,pat Add to Reading List Source URL: www.ida.liu.se Language: English - Date: 2013-03-25 09:28:17 Constraint programming Graph Flow network Local consistency Matroid theory Graph theory Mathematics Theoretical computer science
248	VOL. 63, No. 5 SEPTEMBER, 1956 THE PSYCHOLOGICAL REVIEW STRUCTURAL BALANCE: A GENERALIZATION Add to Reading List Source URL: snap.stanford.edu Language: English - Date: 2013-09-11 13:22:55 Graph Balance theory Trapezoid graph Graph theory Matroid theory Signed graph
249	Low Rank Modeling of Signed Networks Cho-Jui Hsieh Kai-Yang Chiang Inderjit S. Dhillon Add to Reading List Source URL: snap.stanford.edu Language: English - Date: 2012-10-09 01:02:57 Linear algebra Data analysis Matroid theory Signed graph Topology Rank Matrix Cluster analysis Spectral clustering Statistics Mathematics Multivariate statistics
250	Rigid two-dimensional frameworks with two coincident points Zsolt Fekete, Tibor Jord´an, Vikt´ oria E. Kaszanitzky E¨ otv¨ Add to Reading List Source URL: www.fields.utoronto.ca Language: English - Date: 2011-10-21 15:41:02 Graph theory Dimension Matroid Graph Structural rigidity Mathematics Combinatorics Matroid theory

UPDATE