Built something? We create video reels & spotlights for GitHub projects.Promote your project →
Catalog / vijaym123 / K-walk-dominating-set
Public GitHub Catalog Discovered Sep 25, 2026

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.

View repository on GitHub ↗ View creator profile Browse directory

About this discovery

Public repository record indexed from GitHub. Explore verified star velocity metrics, source code repositories, and curated developer tool directories across the GitHubRepo ecosystem.

#3806255GitHub System ID
vijaym123Organization / User
PublicVisibility
ActiveCatalog Status

More from vijaym123

↗

vijaym123/letsencrypt

An ACME client that can obtain certs and extensibly update server configurations (currently supports Apache on .deb based systems, nginx support coming soon)

Discovered
FOR MAINTAINERS

Built something? Put it in front of millions of developers.

We make a short reel about your project and post it across YouTube, Instagram, Threads, and X. Send a link, we do the rest.

SPONSORED Sponsored Partner