Optimization over Degree Sequences

Deza, A., Levin, A., Meesum, S. M., & Onn, S. (2018). Optimization over Degree Sequences. SIAM Journal on Discrete Mathematics.

Type

Journal article

Intellectual base

Primary research

Year

2018

DOI

10.1137/17m1134482

DOI registrant

Society for Industrial & Applied Mathematics

Link

https://doi.org/10.1137/17m1134482

Cited by

1 citation across 1 artifact.

Domain-specific

• Degree (graph theory)
  • … constitutive identity and a convenient observable transfers from In an undirected multigraph, one loop contributes two to the degree because both ends meet the same vertex. to Network analysis distinguishes simple degree, weighted strength, in-degree and out-degree and does not compare them without normalization..

Verification

Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.

Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:dae394c61803 · see in the full table