Live briefing
Everything about Nonblocker
Subgraph
In graph theory, a nonblocker is a subset of vertices in an undirected graph, all of which are adjacent to vertices outside of the subset. Equivalently, a nonblocker is the complement of a dominating set. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: NonblockerA 5-minute orientation
- Pick up a classic book: Compiler-Hidden PostgreSQL Continuations for Direct-Style Server ProgramsThe most-reprinted book on the subject
- Go sideways: KernelizationA closely related topic
- Go sideways: Dominating setA closely related topic
đź“– Definitions
Noun A subset of vertices in an undirected graph, all of which are adjacent to vertices outside of the subset
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
- No matching papers found.
đź“š Books worth reading
Compiler-Hidden PostgreSQL Continuations for Direct-Style Server ProgramsAnnabella Proctor · 2026
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Kernelization In computer science, a kernelization is a technique for designing efficient algorithms that achieve their efficiency by a preprocessing stage in which…
- Dominating set In graph theory, a dominating set for a graph G is a subset D of its vertices, such that any vertex of G is in D, or has a neighbor in D. The domination…
- Odd cycle transversal In graph theory, an odd cycle transversal of an undirected graph is a set of vertices of the graph that has a nonempty intersection with every odd cycle…
- Bidimensionality Bidimensionality theory characterizes a broad range of graph problems (bidimensional) that admit efficient approximate, fixed-parameter or kernel solutions…
- Vertex cover In graph theory, a vertex cover (sometimes node cover) of a graph is a set of vertices that includes at least one endpoint of every edge of the graph.…
- Iterative compression In computer science, iterative compression is an algorithmic technique for the design of fixed-parameter tractable algorithms, in which one element (such…
- Maximum cut In a graph, a maximum cut is a cut whose size is at least the size of any other cut. That is, it is a partition of the graph's vertices into two complementary…
- Connected dominating set In graph theory, a connected dominating set and a maximum leaf spanning tree are two closely related structures defined on an undirected graph. A connected…