Braess’s Paradox in Large Sparse Graphs

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-17572-5_16
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Sparse Universal Graphs for Bounded-Degree Graphs

Random Structures and Algorithms
MathematicsApplied MathematicsComputer GraphicsComputer-Aided DesignSoftware
2007English

Parallel Symmetry-Breaking in Sparse Graphs

SIAM Journal on Discrete Mathematics
Mathematics
1988English

Fast Scrambling on Sparse Graphs

Proceedings of the National Academy of Sciences of the United States of America
Multidisciplinary
2019English

On Ramsey Numbers of Sparse Graphs

Combinatorics Probability and Computing
StatisticsProbabilityApplied MathematicsMathematicsComputational TheoryTheoretical Computer Science
2003English

Fast Generation of Sparse Random Kernel Graphs

PLoS ONE
Multidisciplinary
2015English

Competition for Shortest Paths on Sparse Graphs

Physical Review Letters
AstronomyPhysics
2012English

Finding Paths in Sparse Random Graphs Requires Many Queries

Random Structures and Algorithms
MathematicsApplied MathematicsComputer GraphicsComputer-Aided DesignSoftware
2016English

Distance Approximation in Bounded-Degree and General Sparse Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Computational Complexity of Hedonic Games on Sparse Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy