martinbroadhurst.com rank 64 |
Number of domains linking to martinbroadhurst.com 1 | semantic flow 0.14 |
Number of links to martinbroadhurst.com 2 | semantic flow 0.14 |
Number of domains linked from martinbroadhurst.com 12 | semantic flow 0.53 |
Number of links from martinbroadhurst.com 14 | semantic flow 0.53 |
Pages with highest topical PageRank pointing to domain.
url / atext / target url | |
---|---|
http://www.martinbroadhurst.com/unbounded-knapsack-using-dynamic-programming-in-c.html previous postlongest repeated subsequence using dynamic programming in c ↳http://www.martinbroadhurst.com/longest-repeated-subsequence-using-dynamic-programming-in- | |
http://www.martinbroadhurst.com/boyer-moore-search-of-a-list-for-a-sub-list-in-python.html lists ↳http://www.martinbroadhurst.com/tag/lists | |
http://www.martinbroadhurst.com/combinatorial-algorithms.html next postserver examples ↳http://www.martinbroadhurst.com/server-examples.html | |
http://www.martinbroadhurst.com/longest-increasing-subsequence-using-dynamic-programming-i next postlongest common substring using dynamic programming in c ↳http://www.martinbroadhurst.com/longest-common-substring-using-dynamic-programming-in-c.ht |
On-topic pages from domain with highest topical PageRank.
title / url | |||||||||
---|---|---|---|---|---|---|---|---|---|
Longest Repeated Subsequence using dynamic programming in C | Martin Broadhurst http://www.martinbroadhurst.com/longest-repeated-subsequence-using-dynamic-programming-in- | 0.28 | 0.99 | 73 | 25 | 1 | 1 | 0 | 0 | |
Partition function using dynamic programming in C | Martin Broadhurst http://www.martinbroadhurst.com/partition-function-using-dynamic-programming-in-c.html | 0.28 | 1 | 73 | 23 | 1 | 1 | 0 | 0 | |
Linked list in C | Martin Broadhurst http://www.martinbroadhurst.com/linked-list-in-c.html | 0.28 | 1 | 71 | 24 | 1 | 1 | 0 | 0 | |
Unbounded Knapsack using dynamic programming in C | Martin Broadhurst http://www.martinbroadhurst.com/unbounded-knapsack-using-dynamic-programming-in-c.html | 0.28 | 0.95 | 72 | 24 | 1 | 1 | 0 | 0 | |
Greedy Maximum Independent Set in C | Martin Broadhurst http://www.martinbroadhurst.com/greedy-max-independent-set-in-c.html | 0.28 | 0.95 | 73 | 24 | 1 | 1 | 0 | 0 | |
Boyer-Moore search of a list for a sub-list in Python | Martin Broadhurst http://www.martinbroadhurst.com/boyer-moore-search-of-a-list-for-a-sub-list-in-python.html | 0.28 | 1 | 74 | 26 | 2 | 2 | 0 | 0 | |
Combinatorial algorithms | Martin Broadhurst http://www.martinbroadhurst.com/combinatorial-algorithms.html | 0.28 | 1 | 80 | 24 | 1 | 1 | 0 | 0 | |
Longest Common Substring using dynamic programming in C | Martin Broadhurst http://www.martinbroadhurst.com/longest-common-substring-using-dynamic-programming-in-c.ht | 0.21 | 1 | 73 | 25 | 1 | 1 | 0 | 0 | |
Shellsort in C | Martin Broadhurst http://www.martinbroadhurst.com/shellsort-in-c.html | 0.21 | 1 | 73 | 24 | 2 | 2 | 0 | 0 | |
Longest Increasing Subsequence using dynamic programming in C | Martin Broadhurst http://www.martinbroadhurst.com/longest-increasing-subsequence-using-dynamic-programming-i | 0.21 | 1 | 74 | 24 | 2 | 2 | 0 | 0 |
Relevant domains with most links to selected domain.
domain | |||
---|---|---|---|
http://wikipedia.org/ | 2 | 0.14 | wikipedia.org |
Relevant domains with most links from selected domain.
Pages from domain with most relevant inbound links.
url | |||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|
http://www.martinbroadhurst.com/tag/depth-first-search | 1 | 0.16 | 0.94 | 0.07 | 0.76 | yes | 77 | 27 | 1 | 1 | 0 | 0 | |
http://www.martinbroadhurst.com/sorting-a-linked-list-by-turning-it-into-a-binary-tree.htm | 1 | 0.16 | 0.93 | 0.07 | 1 | yes | 71 | 22 | 1 | 1 | 1 | 1 | |
http://www.martinbroadhurst.com/tag/list | 1 | 0.16 | 0.94 | 0.07 | 0.84 | yes | 91 | 31 | 3 | 2 | 0 | 0 | |
http://www.martinbroadhurst.com/cpp-sorting.html | 1 | 0.16 | 0.91 | 0.07 | 1 | yes | 71 | 23 | 1 | 1 | 1 | 1 | |
http://www.martinbroadhurst.com/tag/greedy | 1 | 0.16 | 0.94 | 0.07 | 0.96 | yes | 96 | 37 | 1 | 1 | 0 | 0 | |
http://www.martinbroadhurst.com/tag/network-programming | 1 | 0.16 | 0.94 | 0.07 | -1 | no | -1 | -1 | -1 | -1 | 0 | 0 | |
http://www.martinbroadhurst.com/tag/binary-tree | 1 | 0.16 | 0.94 | 0.07 | 0.89 | yes | 81 | 33 | 1 | 1 | 0 | 0 | |
http://www.martinbroadhurst.com/tag/combinatorics | 1 | 0.16 | 0.94 | 0.07 | 0.88 | yes | 100 | 34 | 5 | 5 | 0 | 0 | |
http://www.martinbroadhurst.com/tag/backtracking | 1 | 0.16 | 0.79 | 0.06 | -1 | no | -1 | -1 | -1 | -1 | 0 | 0 | |
http://www.martinbroadhurst.com/tag/strings | 1 | 0.16 | 0.6 | 0.04 | 0.67 | yes | 109 | 37 | 7 | 6 | 0 | 0 |
Pages from domain with most likely on-topic outgoing links.
url | |||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|
http://www.martinbroadhurst.com/sorting-a-linked-list-by-turning-it-into-a-binary-tree.htm | 21 | 0.16 | 0.93 | 1.33 | 1 | yes | 71 | 22 | 1 | 1 | 1 | 1 | |
http://www.martinbroadhurst.com/tag/greedy | 15 | 0.16 | 0.94 | 0.93 | 0.96 | yes | 96 | 37 | 1 | 1 | 0 | 0 | |
http://www.martinbroadhurst.com/tag/graph-theory | 15 | 0.16 | 0.94 | 0.72 | 0.83 | yes | 99 | 42 | 1 | 1 | 0 | 0 | |
http://www.martinbroadhurst.com/tag/strings | 15 | 0.16 | 0.6 | 0.4 | 0.67 | yes | 109 | 37 | 7 | 6 | 0 | 0 | |
http://www.martinbroadhurst.com/tag/combinatorics | 12 | 0.16 | 0.94 | 0.61 | 0.88 | yes | 100 | 34 | 5 | 5 | 0 | 0 | |
http://www.martinbroadhurst.com/tag/list | 8 | 0.16 | 0.94 | 0.29 | 0.84 | yes | 91 | 31 | 3 | 2 | 0 | 0 | |
http://www.martinbroadhurst.com/tag/binary-tree | 4 | 0.16 | 0.94 | 0.17 | 0.89 | yes | 81 | 33 | 1 | 1 | 0 | 0 | |
http://www.martinbroadhurst.com/cpp-sorting.html | 1 | 0.16 | 0.91 | 0.07 | 1 | yes | 71 | 23 | 1 | 1 | 1 | 1 | |
http://www.martinbroadhurst.com/counting-nodes-in-a-binary-tree-recursively.html | 1 | 0.16 | 0.84 | 0.03 | 1 | yes | 70 | 23 | 1 | 1 | 0 | 0 | |
http://www.martinbroadhurst.com/tag/network-programming | 1 | 0.16 | 0.94 | 0 | -1 | no | -1 | -1 | -1 | -1 | 0 | 0 |
Similar domains to domain, based on inbound linking patterns from other relevant domains. This is also known in SEO as topical co-citation.