The following pages link to Codes for the World Wide Web (Q5491967):
Displaying 11 items.
- Linearity is strictly more powerful than contiguity for encoding graphs (Q284761) (← links)
- (Nearly-)tight bounds on the contiguity and linearity of cographs (Q393888) (← links)
- Binary codes for locally homogeneous sequences (Q845715) (← links)
- Main-memory triangle computations for very large (sparse (power-law)) graphs (Q955020) (← links)
- Graph compression by BFS (Q1662490) (← links)
- Adaptive succinctness (Q2118203) (← links)
- Compact Indexes for Flexible Top-$$k$$ Retrieval (Q2942258) (← links)
- Parallel Maximum Clique Algorithms with Applications to Network Analysis (Q3447472) (← links)
- Linearity Is Strictly More Powerful Than Contiguity for Encoding Graphs (Q3449818) (← links)
- Sublinear Column-wise Actions of the Matrix Exponential on Social Networks (Q4985793) (← links)
- Efficient semi-external depth-first search (Q6199785) (← links)