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.

graph partition · Vinony

EntityQ491370· pop 9· linked from 50 articles

graph partition

Sign in to save

subdivision of vertices into disjoint sets

Connections

Laplacian matrix

International Standard Book Number

Wayback Machine

digital object identifier

International Standard Serial Number

eigenvectors and eigenvalues

Hamiltonian mechanics

P versus NP problem

partition of a set

finite element method

diagonal matrix

adjacency matrix

Categories

Computational problems in graph theory NP-complete problems

Sources

wikipedia.externallinksexternallink

What links here50 pages

planar separator theorem

strength of a graph

connected component of a graph

Kernighan–Lin algorithm

graph data structure

multipartite graph

Brian Kernighan

vertex separator

algebraic connectivity

NP-intermediate

spectral clustering

memetic algorithm

Similar entities

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

Entitydist 0.26

vertex separator

Entitydist 0.49

Entitydist 0.50

Entitydist 0.51

planar separator theorem

Entitydist 0.52

Entitydist 0.53

threshold graph

Entitydist 0.55

forbidden graph characterization

Entitydist 0.56

Entitydist 0.56

Entitydist 0.57

Entitydist 0.58

area under graph

Entitydist 0.58