Skip to main content
SpringerLink
Log in

Linear algorithm for selecting an almost regular spanning subgraph in an almost regular graph

  • Large Systems
  • Published:
Problems of Information Transmission Aims and scope Submit manuscript

Abstract

We consider almost d-regular graphs, i.e., graphs having all vertex degrees equal to either d or d − 1. It is known that for each d′ ≤ d every d-regular graph contains an almost d′-regular spanning subgraph. We give an algorithm for selecting such a subgraph in optimal linear time.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Petersen, J., Die Theorie der regulären Graphs, Acta Math., 1891, vol. 15, no. 1, pp. 193–220.

    Article  MathSciNet  MATH  Google Scholar 

  2. Harary, F., Graph Theory, Reading, MA: Addison-Wesley, 1969. Translated under the title Teoriya grafov, Moscow: Mir, 1973.

    Google Scholar 

  3. Diks, K. and Stanczyk, P., Perfect Matching for Biconnected Cubic Graphs in O(n log2 n) Time, Proc. 36th Conf. on Current Trends in Theory and Practice of Computer Science (SOFSEM 2010), Spindleruv Mlýn, Czech Republic, 2010, van Leeuwen, J., Muscholl, A., Peleg, D., Pokorný, J., and Rumpe, B., Eds., Lecture Notes Comp. Sci, vol. 5901, Berlin: Springer, 2010, pp. 321–333.

    Google Scholar 

  4. Cole, R., Ost, K., and Schirra, S., Edge-Coloring Bipartite Multigraphs in O(E logD) Time, Combinatorica, 2001, vol. 21, no. 1, pp. 5–12.

    Article  MathSciNet  MATH  Google Scholar 

  5. Schrijver, A., Combinatorial Optimization: Polyhedra and Efficiency, Berlin: Springer, 2003.

    MATH  Google Scholar 

  6. Alon, N., Friedland, S., and Kalai, G., Regular Subgraphs of Almost Regular Graphs, J. Combin. Theory, Ser. B, 1984, vol. 37, no. 1, pp. 79–91.

    Article  MathSciNet  MATH  Google Scholar 

  7. Handbook of Combinatorics, Graham, R.L., Grötschel, M., and Lovász, L., Eds., vol. I, Amsterdam: Elsevier; Cambridge, MA: MIT Press, 1995.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Chair of Mathematical Logic and Theory of Algorithms, Faculty of Mechanics and Mathematics, Lomonosov Moscow State University, Moscow, Russia

    M. A. Babenko & T. A. Urbanovich

Authors
  1. M. A. Babenko
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. T. A. Urbanovich
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. A. Babenko.

Additional information

Original Russian Text © M.A. Babenko, T.A. Urbanovich, 2011, published in Problemy Peredachi Informatsii, 2011, Vol. 47, No. 3, pp. 59–63.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Babenko, M.A., Urbanovich, T.A. Linear algorithm for selecting an almost regular spanning subgraph in an almost regular graph. Probl Inf Transm 47, 269–273 (2011). https://doi.org/10.1134/S0032946011030057

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0032946011030057

Keywords

Search

Navigation