← Back to context Comment by usrusr 8 days ago "Any sufficiently sparse graph is indistinguishable from a linked list" comes to mind ;) 1 comment usrusr Reply gowld 8 days ago A linked list is sparse by the metric of minimum maximum degree (2).A maximally sparse connected graph by mean (degree edge/node ratio) is any tree (mean degree ~ 1), not necessarily a linked list.
gowld 8 days ago A linked list is sparse by the metric of minimum maximum degree (2).A maximally sparse connected graph by mean (degree edge/node ratio) is any tree (mean degree ~ 1), not necessarily a linked list.
A linked list is sparse by the metric of minimum maximum degree (2).
A maximally sparse connected graph by mean (degree edge/node ratio) is any tree (mean degree ~ 1), not necessarily a linked list.