募捐 9月15日2024 – 10月1日2024 关于筹款

The complexity of greedoid Tutte polynomials

  • Main
  • The complexity of greedoid Tutte...

The complexity of greedoid Tutte polynomials

Christopher N. Knapp
0 / 0
0 comments
你有多喜欢这本书？
下载文件的质量如何？
下载该书，以评价其质量
下载文件的质量如何？
年:
2018
出版:
version 28 Feb 2018
语言:
english
页:
149
系列:
PhD thesis at Brunel University London
文件:
PDF, 739 KB
IPFS:
CID , CID Blake2b
english, 2018
线上阅读
正在转换
转换为 失败

关键词

 
graph
polynomial
rooted
greedoid
edges
vertex
width
feasible
proposition
theorem
graphs
vertices
suppose
matroid
algorithm
node
binary
decomposition
edge
ργ
lemma
path
γ2
αj
complexity
γ1
αk
evaluating
directed
function
greedoids
subset
computational
element
exists
matrix
sets
subsets
independent
digraph
equation
input
compute
computing
denote
rank
acyclic
figure
parallel
α1
interval
α2
coefficients
branch
characteristic
define
unique
components
corresponding
defined