View:
- no detail
- some detail
- full detail

7. Digging deeper into networks
Guido Caldarelli and Michele Catanzaro
in Networks: A Very Short Introduction
‘Digging deeper into networks’ shows that to capture the more subtle structure of networks one has to find measures that describe the surroundings of a node — degree distribution is not ...
More

6. Heuristic computing
Subrata Dasgupta
in Computer Science: A Very Short Introduction
Many ordinary problems and everyday activities are not conducive to algorithmic solutions. Yet, people do perform these tasks and solve such problems, so what other computational means are ...
More

9. All the world’s a net; or not?
Guido Caldarelli and Michele Catanzaro
in Networks: A Very Short Introduction
‘All the world's a net; or not?’ summarizes the extent and limitations of network science. There are warnings about the generalizations drawn from network theory, but the results of network ...
More

2. Four types of problem
Robin Wilson
in Combinatorics: A Very Short Introduction
‘Four types of problem’ explains that combinatorics is concerned with four types of problem: existence problems (does x exist?); construction problems (if x exists, how can we construct ...
More

Networks: A Very Short Introduction
Guido Caldarelli and Michele Catanzaro
Networks: A Very Short Introduction considers the basic elements of network theory and its applications using everyday examples from society, technology, nature, and history. ...
More
View:
- no detail
- some detail
- full detail