Using an edge-dual graph and ::::k::::-connectivity to identify strong connections in social networks

Li Ding, Brandon Dixon. Using an edge-dual graph and ::::k::::-connectivity to identify strong connections in social networks. In Proceedings of the 46th Annual Southeast Regional Conference, 2008, Auburn, Alabama, March 28-29, 2008. pages 475-480, ACM, 2008. [doi]

@inproceedings{DingD08,
  title = {Using an edge-dual graph and ::::k::::-connectivity to identify strong connections in social networks},
  author = {Li Ding and Brandon Dixon},
  year = {2008},
  doi = {10.1145/1593105.1593230},
  url = {http://doi.acm.org/10.1145/1593105.1593230},
  tags = {graph-rewriting, social, rewriting},
  researchr = {https://researchr.org/publication/DingD08},
  cites = {0},
  citedby = {0},
  pages = {475-480},
  booktitle = {Proceedings of the 46th Annual Southeast Regional Conference, 2008, Auburn, Alabama, March 28-29, 2008},
  publisher = {ACM},
  isbn = {978-1-60558-105-7},
}