Edge Selection for Undirected Graphs
10.1080/00949655.2018.1511714
Saved in:
Main Authors: | Meng Hwee Victor Ong, Sanjay Chaudhuri, Berwin Turlach |
---|---|
Other Authors: | STATISTICS & APPLIED PROBABILITY |
Format: | Article |
Published: |
Taylor & Francis
2018
|
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/148206 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
EXTENDING DISTRIBUTED DYKSTRA'S ALOGORITHM FOR UNDIRECTED GRAPHS
by: KEVIN LAM KAIBIN
Published: (2021) -
EXTENDING DISTRIBUTED DYKSTRA'S ALOGORITHM FOR UNDIRECTED GRAPHS
by: KEVIN LAM KAIBIN
Published: (2021) -
More efficient periodic traversal in anonymous undirected graphs
by: Czyzowicz, J., et al.
Published: (2013) -
More efficient periodic traversal in anonymous undirected graphs
by: Czyzowicz, J., et al.
Published: (2013) -
EDGE DOMINATION IN GRAPHS
by: ANG WEE KIAT
Published: (2021)