GitHub - vijaym123/K-walk-dominating-set: A dominating set for a graph G = (V, E) is a subset D of V, where the set can be reached from any other vertices in less than or equal k steps with a probability involved is greater than half.

vijaym123 / K-walk-dominating-set Public

Notifications
Fork 0
Star 1

A dominating set for a graph G = (V, E) is a subset D of V, where the set can be reached from any other vertices in less than or equal k steps with a probability involved is greater than half.

1 star 0 forks Branches Tags Activity

Star

Notifications

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 4 Commits
K-Walk-Main.py		K-Walk-Main.py
RandomWalk.py		RandomWalk.py
grid5_intersection.png		grid5_intersection.png
grid5_kwalk.png		grid5_kwalk.png

About

A dominating set for a graph G = (V, E) is a subset D of V, where the set can be reached from any other vertices in less than or equal k steps with a probability involved is greater than half.

Activity

1 star

2 watching

0 forks

Report repository