by

Disk Graph



  1. Agarwal, P.K., Overmars, M., Sharir, M.: Computing maximally separated sets in the plane and independent sets in the intersection graph of unit disks. In: Proceedings 15th Annual ACM-SIAM Symposium on Discrete Algorithms (2004) (to appear)Google Scholar
  2. Baker, B.S.: Approximation algorithms for np-complete problems on planar graphs. Journal of the ACM 41, 153–180 (1994)zbMATHCrossRefGoogle Scholar
  3. Breu, H.: Algorithmic Aspects of constrained unit disk graphs. PhD thesis, University of british Columbia (1996)Google Scholar
  4. Breu, H., Kirkpatrick, D.G.: Unit disc graph recognition is NP-hard. Computational Geometry: Theory and Applications 9, 3–24 (1998)zbMATHMathSciNetGoogle Scholar
  5. Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discrete Mathematics 86, 165–177 (1990)zbMATHCrossRefMathSciNetGoogle Scholar
  6. Erlebach, T., Fiala, J.: Independence and coloring problems on intersection graphs of disks (2001) (manuscript)Google Scholar
  7. Erlebach, T., Fiala, J.: On-line coloring of geometric intersection graphs. Computational Geometry: Theory and Applications 23(2), 243–255 (2002)zbMATHMathSciNetGoogle Scholar
  8. Erlebach, T., Jansen, K., Seidel, E.: Polynomial-time approximation schemes for geometric graphs. In: Proceedings the 12th ACM-SIAM Symposium on Discrete Algorithms (SODA 2001), Washington, DC, January 7-9, pp. 671–679 (2001)Google Scholar
  9. Fiala, J., Fishkin, A.V., Fomin, F.: Off-line and on-line distance constrained labeling of disk graphs. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol. 2161, pp. 464–475. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  10. Gräf, A., Stumpf, M., Weisenfels, G.: On coloring unit disk graphs. Algorithmica 20(3), 277–293 (1998)zbMATHCrossRefMathSciNetGoogle Scholar
  11. Gyárfás, A., Lehel, J.: On-line and first fit colorings of graphs. Journal of Graph Theory 12, 217–227 (1988)zbMATHCrossRefMathSciNetGoogle Scholar
  12. Hliněný, P., Kratochvíl, J.: Representing graphs by disks and balls. Discrete Mathematics 229, 101–124 (2001)zbMATHCrossRefMathSciNetGoogle Scholar
  13. Hochbaum, D., Maass, W.: Approximation schemes for covering and packing problems in image processing and vlsi. Journal of the ACM 32, 130–136 (1985)zbMATHCrossRefMathSciNetGoogle Scholar
  14. HuntIII, H.B., Marathe, M.V., Radhakrishnan, V., Ravi, S.S., Rosenkrantz, D.J., Stearns, R.E.: NC-approximation schemes for NP and PSPACE-hard problems for geometric graphs. J. Algorithms 26(2), 238–274 (1998)CrossRefMathSciNetGoogle Scholar
  15. Koebe, P.: Kontaktprobleme der konformen Abbildung. In: Math.-Phys. Klasse. Berichte Verhande, vol. 88, pp. 141–164. Saechs. Akad. Wiss, Leipzig (1936)Google Scholar
  16. Malesińska, E.: Graph theoretical models for frequency assignment problems. PhD thesis, Technical University of Berlin, Germany (1997)Google Scholar
  17. Marathe, M.V., Breu, H., Hunt III, H.B., Ravi, S.S., Rosenkrantz, D.J.: Simple heuristics for unit disk graphs. Networks 25, 59–68 (1995)zbMATHCrossRefMathSciNetGoogle Scholar
  18. Matsui, T.: Approximation algorithms for maximum independent set problems and fractional coloring problems on unit disk graphs. In: Akiyama, J., Kano, M., Urabe, M. (eds.) JCDCG 1998. LNCS, vol. 1763, pp. 194–200. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  19. Peeters, R.: On coloring j-unit sphere graphs. Tech. rep., Department of Economics, Tilburg University (1991)Google Scholar
  20. Raghavan, V., Spinrad, J.: Robust algorithms for restricted domains. Journal of Algorithms 48(1), 160–172 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  21. Wang, D., Kuo, Y.-S.: A study on two geometric location problems. Information Processing Letters 28, 281–286 (1988)zbMATHCrossRefMathSciNetGoogle Scholar
  22. Tsai, Y.-T., Lin, Y.-L., Hsu, F.R.: The online firstfit algorithm for radio frequency assignment problems. Information Processing Letters 84(4), 195–199 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
DiskDisk Graph

Disc Graph Profile

Disk graph

Disk Graphing

It's a free tool allowing to graphically display the hard disk space usage: it shows all the directories and subdirectories of the hard drive on a single graph, allowing to see the largest directories at a glance. When you combine the resulting graph with other graphs, it will look exactly as you want it. The long-and-narrow or short-and-wide graph will appear in the array adjacent to all the other graphs. Each graph is allocated an equal-sized area in the array, and the oddly shaped graph is drawn into it. Allows users to scan individual folders, or entire disk drives Makes it easy to determine the files and folders using the most space Allow user to explore the directory subtree Double Click on a folder to zoom the view in Get Detailed information on a file or folder, including: File Type Modification Date File Size. Google Chrome cache location changes from RAM disk to HDD 8 days ago by Vincent. Re: Upload bandwidth is not showing on the usage graph 9 days ago by Ann. Upload bandwidth is not showing on the usage graph 9 days ago by Alex.