Explore graph density in detail.
Also find me here:
Baeldung Author
Subham Datta
I'm currently pursuing Ph.D. degree in Computer Engineering from the University of Cyprus. I'm also working at KIOS Research and Innovation Center of Excellence. My research area includes Cyber Security, Algorithms, Machine Learning. In my free time, I love watching cricket and movies.
Here's what I've written (so far):
B-tree Data Structure
Filed under Data Structures, Trees
Learn about a self-balancing tree data structure: B-tree.
Types of Operating Systems
Filed under OS
Learn about five variations of the operating systems: batch, distributed, time-sharing, network, real-time operating system.
Internal Fragmentation vs. External Fragmentation in Paging
Filed under OS
Explore fragmentation and its variations: internal and external.
Flow Control vs. Congestion Control in TCP
Filed under Networking
Explore flow and congestion control mechanisms in TCP.
Segmented Paging vs. Paged Segmentation
Filed under OS
Explore two memory allocation techniques: segmented paging and paged segmentation.
What is Abstract Data Type?
Filed under Data Structures
Explore three popular ADTs: list, queue, stack.
Instructions and Programs
Filed under Programming
Explore the fundamentals of computer programs and instructions with examples.
Knight’s Shortest Path on Chessboard
Filed under Algorithms
Explore the knight’s shortest path problem on a chessboard.
How Is a Minimum Bottleneck Spanning Tree Different from a Minimum Spanning Tree?
Filed under Trees
Compare two very close yet different graph concepts in graph theory: minimum spanning tree, minimum bottleneck spanning tree.