Những tài liệu gần giống với tài liệu bạn đang xem
Những tài liệu bạn đã xem
A simple Havel Hakimi type algorithm to realize graphical degree sequences of directed graphs
One of the simplest ways to decide whether a given finite sequence of positive integers can arise as the degree sequence of a simple graph is the greedy algorithm of Havel and Hakimi. This note extends their approach to directed graphs. It also
pdf Đăng bởi
vinamil01
