Algorithms and Models for the Web Graph [[electronic resource] ] : 15th International Workshop, WAW 2018, Moscow, Russia, May 17-18, 2018, Proceedings / / edited by Anthony Bonato, Paweł Prałat, Andrei Raigorodskii |
Edizione | [1st ed. 2018.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
Descrizione fisica | 1 online resource (IX, 185 p. 34 illus.) |
Disciplina | 005.1 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Data mining Information storage and retrieval systems Application software Computer networks Artificial intelligence Data Mining and Knowledge Discovery Information Storage and Retrieval Computer and Information Systems Applications Computer Communication Networks Artificial Intelligence |
ISBN | 3-319-92871-6 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Information retrieval and data mining on the Web -- Web as a text repository and as a graph, induced in various ways by link among pages, hosts and users -- The understanding of graphs that arise from the Web and various user activities on the Web -- Stimulation of the development of high-performance algorithms and applications that exploit these graphs. |
Record Nr. | UNISA-996465781103316 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Algorithms and Models for the Web Graph : 15th International Workshop, WAW 2018, Moscow, Russia, May 17-18, 2018, Proceedings / / edited by Anthony Bonato, Paweł Prałat, Andrei Raigorodskii |
Edizione | [1st ed. 2018.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
Descrizione fisica | 1 online resource (IX, 185 p. 34 illus.) |
Disciplina | 005.1 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Data mining Information storage and retrieval systems Application software Computer networks Artificial intelligence Data Mining and Knowledge Discovery Information Storage and Retrieval Computer and Information Systems Applications Computer Communication Networks Artificial Intelligence |
ISBN | 3-319-92871-6 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Information retrieval and data mining on the Web -- Web as a text repository and as a graph, induced in various ways by link among pages, hosts and users -- The understanding of graphs that arise from the Web and various user activities on the Web -- Stimulation of the development of high-performance algorithms and applications that exploit these graphs. |
Record Nr. | UNINA-9910349427803321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Algorithms and Models for the Web Graph [[electronic resource] ] : 14th International Workshop, WAW 2017, Toronto, ON, Canada, June 15–16, 2017, Revised Selected Papers / / edited by Anthony Bonato, Fan Chung Graham, Paweł Prałat |
Edizione | [1st ed. 2017.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
Descrizione fisica | 1 online resource (IX, 105 p. 24 illus.) |
Disciplina | 005.1 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Data mining Information storage and retrieval systems Application software Computer networks Artificial intelligence Data Mining and Knowledge Discovery Information Storage and Retrieval Computer and Information Systems Applications Computer Communication Networks Artificial Intelligence |
ISBN | 3-319-67810-8 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Graphs that arise from the Web and various user activities on the Web -- The development of high performance algorithms and applications that exploit graphs -- Graph-theoretic and algorithmic aspects of related complex networks -- Social networks, citation networks, biological networks; molecular networks -- Other networks arising from the Internet. |
Record Nr. | UNISA-996465547503316 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Algorithms and Models for the Web Graph : 14th International Workshop, WAW 2017, Toronto, ON, Canada, June 15–16, 2017, Revised Selected Papers / / edited by Anthony Bonato, Fan Chung Graham, Paweł Prałat |
Edizione | [1st ed. 2017.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 |
Descrizione fisica | 1 online resource (IX, 105 p. 24 illus.) |
Disciplina | 005.1 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Data mining Information storage and retrieval systems Application software Computer networks Artificial intelligence Data Mining and Knowledge Discovery Information Storage and Retrieval Computer and Information Systems Applications Computer Communication Networks Artificial Intelligence |
ISBN | 3-319-67810-8 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Graphs that arise from the Web and various user activities on the Web -- The development of high performance algorithms and applications that exploit graphs -- Graph-theoretic and algorithmic aspects of related complex networks -- Social networks, citation networks, biological networks; molecular networks -- Other networks arising from the Internet. |
Record Nr. | UNINA-9910483245003321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Algorithms and Models for the Web Graph [[electronic resource] ] : 13th International Workshop, WAW 2016, Montreal, QC, Canada, December 14–15, 2016, Proceedings / / edited by Anthony Bonato, Fan Chung Graham, Paweł Prałat |
Edizione | [1st ed. 2016.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 |
Descrizione fisica | 1 online resource (X, 165 p. 42 illus.) |
Disciplina | 004.678 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Data mining Information storage and retrieval systems Application software Computer networks Artificial intelligence Data Mining and Knowledge Discovery Information Storage and Retrieval Computer and Information Systems Applications Computer Communication Networks Artificial Intelligence |
ISBN | 3-319-49787-1 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Algorithms -- Analysis -- Data Models -- Social Networks -- Blogs -- Webmining -- Social Applications. . |
Record Nr. | UNISA-996465519303316 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Algorithms and Models for the Web Graph : 13th International Workshop, WAW 2016, Montreal, QC, Canada, December 14–15, 2016, Proceedings / / edited by Anthony Bonato, Fan Chung Graham, Paweł Prałat |
Edizione | [1st ed. 2016.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 |
Descrizione fisica | 1 online resource (X, 165 p. 42 illus.) |
Disciplina | 004.678 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Data mining Information storage and retrieval systems Application software Computer networks Artificial intelligence Data Mining and Knowledge Discovery Information Storage and Retrieval Computer and Information Systems Applications Computer Communication Networks Artificial Intelligence |
ISBN | 3-319-49787-1 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Algorithms -- Analysis -- Data Models -- Social Networks -- Blogs -- Webmining -- Social Applications. . |
Record Nr. | UNINA-9910484394303321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Algorithms and Models for the Web Graph [[electronic resource] ] : 11th International Workshop, WAW 2014, Beijing, China, December 17-18, 2014, Proceedings / / edited by Anthony Bonato, Fan Chung Graham, Paweł Prałat |
Edizione | [1st ed. 2014.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
Descrizione fisica | 1 online resource (IX, 161 p. 30 illus.) |
Disciplina | 005.1 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Data mining Information storage and retrieval systems Application software Discrete Mathematics in Computer Science Data Mining and Knowledge Discovery Information Storage and Retrieval Computer and Information Systems Applications |
ISBN | 3-319-13123-0 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto |
Intro -- Preface -- Organization -- Contents -- Clustering and the Hyperbolic Geometry of Complex Networks -- 1 Introduction -- 1.1 Random Geometric Graphs on the Hyperbolic Plane -- 1.2 Notation -- 2 Some Geometric Aspects of the Two Models -- 3 The Clustering Coefficient -- 4 Conclusions -- References -- Burning a Graph as a Model of Social Contagion -- 1 Introduction -- 2 Properties of the Burning Number -- 2.1 Characterizations of Burning Number via Trees -- 2.2 Bounds -- 3 Burning in the ILT Model -- 4 Cartesian Grids -- 5 Conclusions and Future Work -- References -- Personalized PageRank with Node-Dependent Restart -- 1 Introduction and Definitions -- 2 Occupation-Time Personalized PageRank -- 3 Location-of-Restart Personalized PageRank -- 4 Interesting Particular Cases -- 4.1 Constant Probability of Restart -- 4.2 Restart Probabilities Proportional to Powers of Degrees -- 4.3 Random Walk with Jumps -- 5 Discussion -- References -- Efficient Computation of the Weighted Clustering Coefficient -- 1 Introduction -- 1.1 Related Works -- 2 Preliminaries -- 2.1 Generalizations of Clustering Coefficient in Weighted Networks -- 3 Computing the Weighted Clustering Coefficient in Probabilistic Networks -- 4 Efficient Estimators for the Weighted Clustering Coefficient -- 5 Experiments -- References -- Global Clustering Coefficient in Scale-Free Networks -- 1 Introduction -- 2 Clustering Coefficients -- 3 Scale-Free Graphs -- 4 Existence of a Graph with Given Degree Distribution -- 4.1 Result -- 4.2 Auxiliary Results -- 4.3 Proof of Theorem 1 -- 5 Global Clustering Coefficient -- 5.1 Result -- 5.2 Proof of Theorem 4 -- 6 Experiments -- 7 Conclusion -- References -- Efficient Primal-Dual Graph Algorithms for MapReduce -- 1 Introduction -- 1.1 Problem Formulations and Results -- 1.2 Technique: Width Modulation -- 1.3 Related Work.
2 Undirected Densest Subgraph -- 2.1 Linear Program and Duality -- 2.2 Width Modulation -- 2.3 Binary Search for D* -- 2.4 Rounding Step: Recovering the Densest Subgraph -- 2.5 Summary of the Algorithm -- 2.6 Number of MapReduce Phases -- References -- A The Multiplicative Weights Update Framework -- B Densest Subgraph in Directed Graphs -- B.1 Parametric LP Formulation -- B.2 Covering Program and Width Modulation -- B.3 Parametric Search -- B.4 Rounding Step: Recovering the Densest Subgraph -- C Fractional Matchings in Bipartite Graphs -- C.1 Covering Program, Width Modulation, and Binary Search -- C.2 Rounding Step: Recovering the Fractional Matching -- References -- Computing Diffusion State Distance Using Green's Function and Heat Kernel on Graphs -- 1 Introduction -- 2 Notation and Background -- 3 Proof of Main Theorem -- 4 Some Examples of the DSD Distance -- 4.1 The Path Pn -- 4.2 The Cycle Cn -- 4.3 The Hypercube Qn -- 5 Random Graphs -- 6 Examples of Biological Networks -- References -- Relational Topic Factorization for Link Prediction in Document Networks -- 1 Introduction -- 2 Related Work -- 3 Proposed Model -- 3.1 Relational Topic Factorization -- 3.2 Learning the Parameters -- 4 Empirical Results -- 4.1 Dataset -- 4.2 Evaluation Metrics -- 4.3 In-matrix Prediction -- 4.4 Out-of-Matrix Prediction -- 4.5 Relationship with Document Properties -- 4.6 Examining Topic Spaces -- 5 Conclusions and Future Work -- References -- Firefighting as a Game -- 1 Introduction -- 2 Game-Theoretical Definitions -- 3 The Firefighting Game -- 3.1 Utility Functions -- 3.2 Quality of Equilibria -- 3.3 Price of Anarchy for Trees -- 4 Coalitions -- 4.1 Price of Anarchy -- 4.2 Graphs with Constant Cut-Width -- 5 Conclusions -- References -- PageRank in Scale-Free Random Graphs -- 1 Introduction -- 2 Directed Random Graphs -- 3 PageRank Iterations in the DCM. 4 Main Result: Coupling with a Thorny Branching Tree -- 5 Numerical Results -- References -- Modelling of Trends in Twitter Using Retweet Graph Dynamics -- 1 Introduction -- 2 Related Work -- 3 Datasets -- 4 Retweet Graphs -- 5 Model -- 5.1 Growth of the Graph -- 5.2 Component Size Distribution -- 5.3 Influence of q, p and -- 6 The Model in Practice -- 7 Conclusion and Discussion -- References -- LiveRank: How to Refresh Old Crawls -- 1 Introduction -- 2 Model -- 2.1 Performance Metric -- 2.2 PageRank -- 2.3 Static LiveRanks -- 2.4 Sample-Based LiveRanks -- 2.5 Dynamic LiveRanks -- 3 Datasets -- 3.1 uk-2002 Dataset -- 3.2 uk-2006 Dataset -- 3.3 Correlations -- 4 LiveRanks Evaluation -- 4.1 Static and Sample-Based LiveRanks -- 4.2 Quantitative and Qualitative Impact of the Training Set -- 4.3 Dynamic LiveRanks -- 4.4 uk-2006 Dataset -- 4.5 Comparison with a Site-Based Approach -- 5 Conclusion -- References -- Author Index. |
Record Nr. | UNISA-996210529803316 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Algorithms and Models for the Web Graph : 11th International Workshop, WAW 2014, Beijing, China, December 17-18, 2014, Proceedings / / edited by Anthony Bonato, Fan Chung Graham, Paweł Prałat |
Edizione | [1st ed. 2014.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
Descrizione fisica | 1 online resource (IX, 161 p. 30 illus.) |
Disciplina | 005.1 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Data mining Information storage and retrieval systems Application software Discrete Mathematics in Computer Science Data Mining and Knowledge Discovery Information Storage and Retrieval Computer and Information Systems Applications |
ISBN | 3-319-13123-0 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto |
Intro -- Preface -- Organization -- Contents -- Clustering and the Hyperbolic Geometry of Complex Networks -- 1 Introduction -- 1.1 Random Geometric Graphs on the Hyperbolic Plane -- 1.2 Notation -- 2 Some Geometric Aspects of the Two Models -- 3 The Clustering Coefficient -- 4 Conclusions -- References -- Burning a Graph as a Model of Social Contagion -- 1 Introduction -- 2 Properties of the Burning Number -- 2.1 Characterizations of Burning Number via Trees -- 2.2 Bounds -- 3 Burning in the ILT Model -- 4 Cartesian Grids -- 5 Conclusions and Future Work -- References -- Personalized PageRank with Node-Dependent Restart -- 1 Introduction and Definitions -- 2 Occupation-Time Personalized PageRank -- 3 Location-of-Restart Personalized PageRank -- 4 Interesting Particular Cases -- 4.1 Constant Probability of Restart -- 4.2 Restart Probabilities Proportional to Powers of Degrees -- 4.3 Random Walk with Jumps -- 5 Discussion -- References -- Efficient Computation of the Weighted Clustering Coefficient -- 1 Introduction -- 1.1 Related Works -- 2 Preliminaries -- 2.1 Generalizations of Clustering Coefficient in Weighted Networks -- 3 Computing the Weighted Clustering Coefficient in Probabilistic Networks -- 4 Efficient Estimators for the Weighted Clustering Coefficient -- 5 Experiments -- References -- Global Clustering Coefficient in Scale-Free Networks -- 1 Introduction -- 2 Clustering Coefficients -- 3 Scale-Free Graphs -- 4 Existence of a Graph with Given Degree Distribution -- 4.1 Result -- 4.2 Auxiliary Results -- 4.3 Proof of Theorem 1 -- 5 Global Clustering Coefficient -- 5.1 Result -- 5.2 Proof of Theorem 4 -- 6 Experiments -- 7 Conclusion -- References -- Efficient Primal-Dual Graph Algorithms for MapReduce -- 1 Introduction -- 1.1 Problem Formulations and Results -- 1.2 Technique: Width Modulation -- 1.3 Related Work.
2 Undirected Densest Subgraph -- 2.1 Linear Program and Duality -- 2.2 Width Modulation -- 2.3 Binary Search for D* -- 2.4 Rounding Step: Recovering the Densest Subgraph -- 2.5 Summary of the Algorithm -- 2.6 Number of MapReduce Phases -- References -- A The Multiplicative Weights Update Framework -- B Densest Subgraph in Directed Graphs -- B.1 Parametric LP Formulation -- B.2 Covering Program and Width Modulation -- B.3 Parametric Search -- B.4 Rounding Step: Recovering the Densest Subgraph -- C Fractional Matchings in Bipartite Graphs -- C.1 Covering Program, Width Modulation, and Binary Search -- C.2 Rounding Step: Recovering the Fractional Matching -- References -- Computing Diffusion State Distance Using Green's Function and Heat Kernel on Graphs -- 1 Introduction -- 2 Notation and Background -- 3 Proof of Main Theorem -- 4 Some Examples of the DSD Distance -- 4.1 The Path Pn -- 4.2 The Cycle Cn -- 4.3 The Hypercube Qn -- 5 Random Graphs -- 6 Examples of Biological Networks -- References -- Relational Topic Factorization for Link Prediction in Document Networks -- 1 Introduction -- 2 Related Work -- 3 Proposed Model -- 3.1 Relational Topic Factorization -- 3.2 Learning the Parameters -- 4 Empirical Results -- 4.1 Dataset -- 4.2 Evaluation Metrics -- 4.3 In-matrix Prediction -- 4.4 Out-of-Matrix Prediction -- 4.5 Relationship with Document Properties -- 4.6 Examining Topic Spaces -- 5 Conclusions and Future Work -- References -- Firefighting as a Game -- 1 Introduction -- 2 Game-Theoretical Definitions -- 3 The Firefighting Game -- 3.1 Utility Functions -- 3.2 Quality of Equilibria -- 3.3 Price of Anarchy for Trees -- 4 Coalitions -- 4.1 Price of Anarchy -- 4.2 Graphs with Constant Cut-Width -- 5 Conclusions -- References -- PageRank in Scale-Free Random Graphs -- 1 Introduction -- 2 Directed Random Graphs -- 3 PageRank Iterations in the DCM. 4 Main Result: Coupling with a Thorny Branching Tree -- 5 Numerical Results -- References -- Modelling of Trends in Twitter Using Retweet Graph Dynamics -- 1 Introduction -- 2 Related Work -- 3 Datasets -- 4 Retweet Graphs -- 5 Model -- 5.1 Growth of the Graph -- 5.2 Component Size Distribution -- 5.3 Influence of q, p and -- 6 The Model in Practice -- 7 Conclusion and Discussion -- References -- LiveRank: How to Refresh Old Crawls -- 1 Introduction -- 2 Model -- 2.1 Performance Metric -- 2.2 PageRank -- 2.3 Static LiveRanks -- 2.4 Sample-Based LiveRanks -- 2.5 Dynamic LiveRanks -- 3 Datasets -- 3.1 uk-2002 Dataset -- 3.2 uk-2006 Dataset -- 3.3 Correlations -- 4 LiveRanks Evaluation -- 4.1 Static and Sample-Based LiveRanks -- 4.2 Quantitative and Qualitative Impact of the Training Set -- 4.3 Dynamic LiveRanks -- 4.4 uk-2006 Dataset -- 4.5 Comparison with a Site-Based Approach -- 5 Conclusion -- References -- Author Index. |
Record Nr. | UNINA-9910483535003321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Algorithms and Models for the Web Graph [[electronic resource] ] : 10th International Workshop, WAW 2013, Cambridge, MA, USA, December 14-15, 2013, Proceedings / / edited by Anthony Bonato, Michael Mitzenmacher, Pawel Pralat |
Edizione | [1st ed. 2013.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2013 |
Descrizione fisica | 1 online resource (X, 233 p. 40 illus.) |
Disciplina | 005.1 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Data mining Information storage and retrieval systems Discrete Mathematics in Computer Science Data Mining and Knowledge Discovery Information Storage and Retrieval |
ISBN | 3-319-03536-3 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Asymmetric Distribution of Nodes in the Spatial Preferred Attachment Model -- A Spatial Preferential Attachment Model with Local Clustering -- A Local Clustering Algorithm for Connection -- On the Power of Adversarial Infections in Networks -- On the Choice of Kernel and Labelled Data in Semi-supervised Learning Methods -- A Nearly-Sublinear Method for Approximating a Column of the Matrix Exponential for Matrices from Large, Sparse Networks -- Evolution of the Media Web -- Random Intersection Graph Process -- Alpha Current Flow Betweenness Centrality -- Tree Nash Equilibria in the Network Creation Game -- Fast Low-Cost Estimation of Network Properties Using Random Walks -- An Lp Norm Relaxation Approach to Positive Influence Maximization in Social Network under the Deterministic Linear Threshold Model -- Fast Algorithms for the Maximum Clique Problem on Massive Sparse -- A Faster Algorithm to Update Betweenness Centrality after Node Alteration -- Generalized Preferential Attachment: Tunable Power-Law Degree Distribution and Clustering Coefficient -- Solving Linear Systems with Boundary Conditions Using Heat Kernel Pagerank -- Anarchy Is Free in Network Creation. |
Record Nr. | UNISA-996465277003316 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2013 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Algorithms and Models for the Web Graph : 10th International Workshop, WAW 2013, Cambridge, MA, USA, December 14-15, 2013, Proceedings / / edited by Anthony Bonato, Michael Mitzenmacher, Pawel Pralat |
Edizione | [1st ed. 2013.] |
Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2013 |
Descrizione fisica | 1 online resource (X, 233 p. 40 illus.) |
Disciplina | 005.1 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Data mining Information storage and retrieval systems Discrete Mathematics in Computer Science Data Mining and Knowledge Discovery Information Storage and Retrieval |
ISBN | 3-319-03536-3 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Asymmetric Distribution of Nodes in the Spatial Preferred Attachment Model -- A Spatial Preferential Attachment Model with Local Clustering -- A Local Clustering Algorithm for Connection -- On the Power of Adversarial Infections in Networks -- On the Choice of Kernel and Labelled Data in Semi-supervised Learning Methods -- A Nearly-Sublinear Method for Approximating a Column of the Matrix Exponential for Matrices from Large, Sparse Networks -- Evolution of the Media Web -- Random Intersection Graph Process -- Alpha Current Flow Betweenness Centrality -- Tree Nash Equilibria in the Network Creation Game -- Fast Low-Cost Estimation of Network Properties Using Random Walks -- An Lp Norm Relaxation Approach to Positive Influence Maximization in Social Network under the Deterministic Linear Threshold Model -- Fast Algorithms for the Maximum Clique Problem on Massive Sparse -- A Faster Algorithm to Update Betweenness Centrality after Node Alteration -- Generalized Preferential Attachment: Tunable Power-Law Degree Distribution and Clustering Coefficient -- Solving Linear Systems with Boundary Conditions Using Heat Kernel Pagerank -- Anarchy Is Free in Network Creation. |
Record Nr. | UNINA-9910484617503321 |
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2013 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|