Computing the Tutte Polynomial of a Graph of Moderate Size.
Kyoko SekineHiroshi ImaiSeiichiro TaniPublished in: ISAAC (1995)
Keyphrases
- bounded degree
- graph representation
- graph model
- homology generators
- graph structure
- random walk
- directed graph
- graph theory
- exponential size
- bounded treewidth
- graph theoretic
- maximal cliques
- graph databases
- dependency graph
- constant factor
- graph construction
- graph mining
- directed acyclic graph
- link analysis
- weighted graph
- graph matching
- structured data