Skip to main content
SpringerLink
Log in

Probe Matrix Problems: Totally Balanced Matrices

  • Conference paper
Algorithmic Aspects in Information and Management (AAIM 2007)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4508))

Included in the following conference series:

Abstract

Let be a class of 0/1-matrices. A 0/1/ ⋆-matrix A where the ⋆s induce a submatrix is a probe matrix of  if the ⋆s in A can be replaced by 0s and 1s such that A becomes a member of . We show that for being the class of totally balanced matrices, it can be decided in polynomial time whether A is a probe totally balanced matrix. On our route toward proving this main result, we also prove that so-called partitioned probe strongly chordal graphs and partitioned probe chordal bipartite graphs can be recognized in polynomial time.

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. Beresnev, V.L.: An efficient algorithm for the uncapacitated facility location problem with totally balanced matrix. Discrete Applied Mathematics 114, 13–22 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  2. Berge, C.: Balanced matrices. Mathematical Programming 2, 19–31 (1972)

    Article  MathSciNet  MATH  Google Scholar 

  3. Berry, A., Golumbic, M.C., Lipshteyn, M.: Two tricks to triangulate chordal probe graphs in polynomial time. In: Proc. of 15th ACM–SIAM SODA, pp. 962–969. ACM Press, New York (2004)

    Google Scholar 

  4. Brandstädt, A., Le, V.B., Spinrad, J.P.: Graph Classes: a Survey. SIAM Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia (1999)

    MATH  Google Scholar 

  5. Chang, G.J., Kloks, A.J.J., Liu, J., Peng, S.-L.: The pIGs full monty – A floor show of minimal separators. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol. 3404, pp. 521–532. Springer, Heidelberg (2005)

    Google Scholar 

  6. Chang, G.J.: k-Domination and Graph Covering Problems. PhD thesis, School of OR and IE, Cornell University, Ithica, NY, USA (1982)

    Google Scholar 

  7. Chudnovsky, M., Robertson, N., Seymour, P.D., Thomas, R.: The strong perfect graph theorem. Annals of Mathematics 164(1), 51–229 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  8. Conforti, M.: Decomposition of balanced matrices. Journal of Combinatorial Theory, Series B 77, 292–406 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  9. Dahlhaus, E.: Chordale Graphen im besonderen Hinblick auf parallele Algorithmen. Habilitationsschrift, Universität Bonn, Germany (1991)

    Google Scholar 

  10. Farach, M., Kannan, S., Warnow, T.: A robust model for finding optimal evolutionary trees. Algorithmica 13, 155–179 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  11. Farber, M.: Characterizations of strongly chordal graphs. Discrete Mathematics 43, 173–189 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  12. Faria, L., de Figueiredo, C., Klein, S., Sritharan, R.: On the complexity of the sandwich problem for strongly chordal graphs and chordal bipartite graphs. Submitted to Theoretical Computer Science (2006)

    Google Scholar 

  13. Golumbic, M.C.: Matrix sandwich problems. Linear Algebra and its Applications 277, 239–251 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  14. Golumbic, M.C., Kaplan, H., Shamir, R.: Graph sandwich problems. Journal of Algorithms 19, 449–473 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  15. Golumbic, M.C., Lipshteyn, M.: Chordal probe graphs. Discrete Applied Mathematics 143, 221–237 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  16. Golumbic, M.C., Wassermann, A.: Complexity and algorithms for graph and hypergraph sandwich problems. Graphs and Combinatorics 14, 223–239 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  17. Hayward, R., Reed, B.A.: Forbidding holes and antiholes. In: Ramírez, J.L.A., Reed, B.A. (eds.) Perfect Graphs, John Wiley & Sons, Chichester (2001)

    Google Scholar 

  18. Huang, J.: Representation characterizations of chordal bipartite graphs. Journal of Combinatorial Theory, Series B 96, 673–683 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  19. Lubiw, A.: Doubly lexical orderings of matrices. SIAM Journal on Computing 16, 854–879 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  20. Paige, R., Tarjan, R.E.: Three partition refinement algorithms. SIAM Journal on Computing 16, 973–989 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  21. Schrijver, A.: Theory of Linear and Integer Programming. John Wiley & Sons, Chichester (1986)

    MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  23. Zambelli, G.: A polynomial recognition algorithm for balanced matrices. Journal of Combinatorial Theory, Series B 95, 49–67 (2005)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematical Sciences, University of Delaware, Newark, Delaware 19716,  

    David B. Chandler

  2. Institut für Informatik, Friedrich-Schiller-Universität Jena, Ernst-Abbe-Platz 2, D-07743 Jena, Germany

    Jiong Guo & Rolf Niedermeier

  3. School of Computing, University of Leeds, Leeds LS2 9JT, UK

    Ton Kloks

Authors
  1. David B. Chandler
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jiong Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ton Kloks
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Rolf Niedermeier
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ming-Yang Kao Xiang-Yang Li

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Chandler, D.B., Guo, J., Kloks, T., Niedermeier, R. (2007). Probe Matrix Problems: Totally Balanced Matrices. In: Kao, MY., Li, XY. (eds) Algorithmic Aspects in Information and Management. AAIM 2007. Lecture Notes in Computer Science, vol 4508. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72870-2_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-72870-2_35

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-72868-9

  • Online ISBN: 978-3-540-72870-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation