On (s, t)-supereulerian graphs with linear degree bounds.
Lan LeiWei XiongYikang XieMingquan ZhanHong-Jian LaiPublished in: Discret. Math. (2021)
Keyphrases
- upper bound
- series parallel
- worst case
- weighted graph
- graph matching
- graph model
- graph representation
- linear functions
- random graphs
- average case
- spanning tree
- graph mining
- confidence bounds
- labeled graphs
- degree distribution
- upper and lower bounds
- vc dimension
- data sets
- error bounds
- directed graph
- structured data
- lower bound
- pattern recognition
- feature selection
- machine learning