Načítá se...
Structural properties of the minimum cut of partially-supplied graphs
It is well known that information about the structure of a graph is contained within its minimum cut. Here we investigate how the minimum cut of one graph informs the structure of a second, related graph. We consider pairs of graphs G and H, with respective Laplacian matrices L and M, and call H par...
Uloženo v:
| Vydáno v: | Discrete Appl Math |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
2014
|
| Témata: | |
| On-line přístup: | https://ncbi.nlm.nih.gov/pmc/articles/PMC4228376/ https://ncbi.nlm.nih.gov/pubmed/25400306 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1016/j.dam.2014.05.043 |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo otaguje tento záznam!
|