Skip to main content
SpringerLink
Log in

Recognition Algorithms for Binary Signed-Graphic Matroids

  • Conference paper
Combinatorial Optimization (ISCO 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7422))

Included in the following conference series:

Abstract

In this paper we provide two recognition algorithms for the class of signed-graphic matroids along with necessary and sufficient conditions for a matroid to be signed-graphic. Specifically, we provide a polynomial-time algorithm which determines whether a given binary matroid is signed-graphic and an algorithm which determines whether a general matroid given by an independence oracle is binary signed-graphic.

This research has been funded by the European Union (European Social Fund - ESF) and Greek national funds through the Operational Program ”Education and Lifelong Learning” of the National Strategic Reference Framework (NSRF) - Research Funding Program: Thalis. Investing in knowledge society through the European Social Fund.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Appa, G., Kotnyek, B.: Rational and integral k-regular matrices. Discrete Mathematics 275, 1–15 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  2. Appa, G., Kotnyek, B.: A bidirected generalization of network matrices. Networks 47, 185–198 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bixby, R.E., Cunningham, W.H.: Converting linear programs to network problems. Mathematics of Operations Research 5, 321–357 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  4. Camion, P.: Characterization of totally unimodular matrices. Proceedings of the American Mathematical Society 16, 1068–1073 (1965)

    Article  MathSciNet  MATH  Google Scholar 

  5. Camion, P.: Caractérisation des matrices unimodulaires. Cahier du Centre d’Études de Recherche Opérationelle 5, 181–190 (1963)

    MathSciNet  MATH  Google Scholar 

  6. Cornuejols, G.: Combinatorial Optimization - Packing and Covering. Society for Industrial and Applied Mathematics (2001)

    Google Scholar 

  7. Coullard, C.R., Del Greco, J.G., Wagner, D.K.: Recognizing a Class of Bicircular Matroids. Discrete Applied Mathematics 43, 197–215 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  8. Diestel, R.: Graph Theory. Graduate Texts in Mathematics. Springer (2005)

    Google Scholar 

  9. Del Greco, J.G.: Characterizing bias matroids. Discrete Mathematics 103, 153–159 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  10. Kotnyek, B.: A generalisation of totally unimodular and network matrices. PhD thesis, London School of Economics and Political Science, London, UK (2002)

    Google Scholar 

  11. Lee, J.: The incidence structure with well-scaled frames. Journal of Combinatorial Theory Series B 50, 265–287 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  12. Musitelli, A.: Recognizing binet matrices. Mathematical Programming 124, 349–381 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  13. Musitelli, A.: Recognition of Generalised Network Matrices. PhD. Thesis, Ecole Polytechnique Federale de Lausanne (2007)

    Google Scholar 

  14. Oxley, J.G.: Matroid Theory. Oxford University Press (2006)

    Google Scholar 

  15. Pagano, S.R.: Separability and representability of bias matroids of signed graphs. PhD thesis, Binghampton University (1998)

    Google Scholar 

  16. Papalamprou, K., Pitsoulis, L.: Decomposition of binary signed-graphic matroids (submitted) Preprint, http://arxiv.org/

  17. Papalamprou, K., Pitsoulis, L.: Recognition algorithms for binary signed-graphic matroids (2012), http://arxiv.org/

  18. Seymour, P.D.: Decomposition of regular matroids. Journal of Combinatorial Theory Series B 28, 305–359 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  19. Seymour, P.D.: Recognizing graphic matroids. Combinatorica 1, 75–78 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  20. Slilaty, D.: Projective-planar signed graphs and tangled signed graphs. Journal of Combinatorial Theory Series B 97, 693–717 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  21. Slilaty, D., Qin, H.: Decompositions of signed-graphic matroids. Discrete Mathematics 307, 2187–2199 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  22. Strang, G.: Linear Algebra and Its Applications. Brooks Cole (2005)

    Google Scholar 

  23. Truemper, K.: Matroid Decomposition. Leibniz (1998)

    Google Scholar 

  24. Tutte, W.T.: An algorithm for determining whether a given binary matroid is graphic. Proceedings of the American Mathematical Society 11, 905–917 (1960)

    MathSciNet  Google Scholar 

  25. Whittle, G.: On matroids representable over GF(3) and other fields. Transactions of the American Mathematical Society 349, 579–603 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  26. Zaslavsky, T.: Signed graphs. Discrete Applied Mathematics 4, 47–74 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  27. Zaslavsky, T.: Biased graphs. II. The three matroids. Journal of Combinatorial Theory Series B 51, 46–72 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  28. Zaslavsky, T.: Orientation of signed graphs. European Journal of Combinatorics 12, 361–375 (1991)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Management Science Group, Department of Management, London School of Economics and Political Science, Houghton Street, London, WC2A 2AE, UK

    Konstantinos Papalamprou

  2. Department of Mathematical, Physical and Computational Sciences, Faculty of Engineering, Aristotle University of Thessaloniki, Thessaloniki, 54124, Greece

    Leonidas Pitsoulis

Authors
  1. Konstantinos Papalamprou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Leonidas Pitsoulis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. LAMSADE, Université Paris-Dauphine, Place du Maréchal de Lattre de Tassigny, 75775, Paris Cedex 16, France

    A. Ridha Mahjoub  & Vangelis Th. Paschos  & 

  2. Department of Informatics, Athens University of Economics and Business, 76 Patission str., 10434, Athens, Greece

    Vangelis Markakis  & Ioannis Milis  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Papalamprou, K., Pitsoulis, L. (2012). Recognition Algorithms for Binary Signed-Graphic Matroids. In: Mahjoub, A.R., Markakis, V., Milis, I., Paschos, V.T. (eds) Combinatorial Optimization. ISCO 2012. Lecture Notes in Computer Science, vol 7422. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32147-4_41

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32147-4_41

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32146-7

  • Online ISBN: 978-3-642-32147-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation