#### Filter Results:

- Full text PDF available (3)

#### Publication Year

2011

2016

- This year (0)
- Last 5 years (2)
- Last 10 years (3)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Marije de Heus
- 2011

Despite the wide availability of multi-core processors and the popularity of Java, there is currently no library for parallel graph algorithms in Java available. Such a library would enable all Java programmers, especially those who work on the verification of programs and model checking to efficiently use graph algorithms. To find out what would be a good… (More)

- Marije de Heus, Djoerd Hiemstra
- DIR
- 2013

We have performed a readability study on more than 1 billion web pages. The Automated Readability Index was used to determine the average grade level required to easily comprehend a website. Some of the results are that a 16-year-old can easily understand 50% of the web and an 18-year old can easily understand 77% of the web. This information can be used in… (More)

- Swati Dhingra, Poorvi S. Dodwad, +10 authors Saleh Alshomrani
- 2016

A strongly connected component (SCC) of a digraph is a maximal set of vertices such that every vertex is reachable from every other vertex. This topic is very interesting because of the way the algorithm can be used in various applications of network and communications. The Strongly Connected Components Detection (SCCD) algorithm can be a powerful tool in… (More)

- ‹
- 1
- ›