标签graphs - 这是页6 - GeneraCodice

How to edge-color a directed acyclic graph so that every path visits none or all edges of each color?

https://www.generacodice.com/cn/articolo/2479095/how-to-edge-color-a-directed-acyclic-graph-so-that-every-path-visits-none-or-all-edges-of-each-color
  algorithms  -  graphs  -  colorings  -  topological-ordering
cs.stackexchange cs.stackexchange

基于每个节点上的连接数随机生成图形

https://www.generacodice.com/cn/articolo/2477865/基于每个节点上的连接数随机生成图形
  graphs  -  randomized-algorithms
cs.stackexchange cs.stackexchange

什么是统治者节点和统治者树？

https://www.generacodice.com/cn/articolo/2477821/什么是统治者节点和统治者树
  trees  -  compilers  -  graphs
cs.stackexchange cs.stackexchange

CMCG（约束最大重连接图）问题NP-Complete吗？

https://www.generacodice.com/cn/articolo/2477650/cmcg-约束最大重连接图-问题np-complete吗
  np-complete  -  graphs  -  weighted-graphs  -  subgraphs
cs.stackexchange cs.stackexchange

残余图中流动的引理证明

https://www.generacodice.com/cn/articolo/2477614/残余图中流动的引理证明
  algorithms  -  graphs  -  network-flow
cs.stackexchange cs.stackexchange

找到最大匹配，使一组给定的顶点饱和

https://www.generacodice.com/cn/articolo/2477210/找到最大匹配-使一组给定的顶点饱和
  graphs  -  bipartite-matching
cs.stackexchange cs.stackexchange

寻找一种算法，以最大限度地减少双方图表中的边缘遍历的成本，受约束

https://www.generacodice.com/cn/articolo/2476913/寻找一种算法-以最大限度地减少双方图表中的边缘遍历的成本-受约束
  graphs  -  network-flow
cs.stackexchange cs.stackexchange

用指定数量的顶点进行最小切割的高效算法

https://www.generacodice.com/cn/articolo/2476858/用指定数量的顶点进行最小切割的高效算法
  optimization  -  time-complexity  -  algorithms  -  graphs
cs.stackexchange cs.stackexchange
发现结果: 3701
scroll top