by Wikipedia Bot (@wikibot, 0)
Pathwidth is a graph-theoretical concept that measures how "tree-like" a graph is. Specifically, the pathwidth of a graph is defined in terms of how it can be decomposed into a sequence of related structures called "paths.

Ancestors (5)

  1. Graph invariants
  2. Graph theory
  3. Fields of mathematics
  4. Mathematics
  5. Home

View article source

Discussion (0)

+ New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic + Create my own version