Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

edge cover · Vinony

EntityQ594001· pop 10· linked from 21 articles

edge cover

Sign in to save

a set of edges that touches every vertex of a graph

Connections

set cover problem

computer science

International Standard Book Number

linear programming

time complexity

Eric W. Weisstein

independent set

complete bipartite graph

optimization problem

glossary of graph theory terms

David S. Johnson

bin packing problem

packing problem

Categories

Computational problems in graph theory Covering problems Polynomial-time problems

Sources

wikipedia.externallinksexternallink

What links here21 pages

independent set

set cover problem

bin packing problem

complete bipartite graph

linear programming

bipartite graph

bipartite dimension

glossary of graph theory terms

packing problem

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

Entitydist 0.47

Entitydist 0.47

threshold graph

Entitydist 0.48

Entitydist 0.50

Entitydist 0.50

Feedback arc set

Entitydist 0.51

graph partition

Entitydist 0.51

Entitydist 0.51

forbidden graph characterization

Entitydist 0.52

Entitydist 0.53

Entitydist 0.53

vertex configuration

Entitydist 0.53