Skip to main content
russtbarnacle's user avatar
russtbarnacle's user avatar
russtbarnacle's user avatar
russtbarnacle
  • Member for 14 years, 7 months
  • GB
awarded
awarded
awarded
awarded
comment
Graph algorithm to find all subgraphs that connect N arbitrary vertices
I'm rapidly moving out of my depth it appears but my understanding was that Steiner trees create vertices that would not of been in the original graph. Is a Steiner node (in relation to graphs) in fact any node that is in the original graph but not a terminal node?
comment
Graph algorithm to find all subgraphs that connect N arbitrary vertices
My understanding was that Steiner trees introduce intermediate vertices and edges? My graph is fixed, does this algorithm give the subgraphs without adding vertices or edges?
Loading…