Crossmark

Algorithms for finding a rooted<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mrow><mml:mo>(</mml:mo><mml:mi>k</mml:mi><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math>-edge-connected orientation

Crossref DOI link: https://doi.org/10.1016/j.dam.2013.10.004

Published Print: 2014-03

Update policy: https://doi.org/10.1016/elsevier_cm_policy

Authors

Király, Csaba
Funding

Funding for this research was provided by:

Research and Technology Innovation Fund (CK 80124, K 10924)

MTA-ELTE Egerváry Research Group
License Information

Text and Data Mining valid from 2014-03-01

Version of Record valid from 2018-04-16
More Information

This article is maintained by: Elsevier

Article Title: Algorithms for finding a rooted -edge-connected orientation

Journal Title: Discrete Applied Mathematics

CrossRef DOI link to publisher maintained version: https://doi.org/10.1016/j.dam.2013.10.004

Content Type: article

Copyright: Copyright © 2013 Elsevier B.V. All rights reserved.

Document is current

Any future updates will be listed below