Добірка наукової літератури з теми "Geometric Intersection Graphs"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Geometric Intersection Graphs".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Geometric Intersection Graphs"
Fekete, Sándor P., and Phillip Keldenich. "Conflict-Free Coloring of Intersection Graphs." International Journal of Computational Geometry & Applications 28, no. 03 (September 2018): 289–307. http://dx.doi.org/10.1142/s0218195918500085.
Повний текст джерелаBaste, Julien, and Dimitrios M. Thilikos. "Contraction Bidimensionality of Geometric Intersection Graphs." Algorithmica 84, no. 2 (January 24, 2022): 510–31. http://dx.doi.org/10.1007/s00453-021-00912-w.
Повний текст джерелаEppstein, David. "Testing bipartiteness of geometric intersection graphs." ACM Transactions on Algorithms 5, no. 2 (March 2009): 1–35. http://dx.doi.org/10.1145/1497290.1497291.
Повний текст джерелаCabello, Sergio, and Wolfgang Mulzer. "Minimum cuts in geometric intersection graphs." Computational Geometry 94 (March 2021): 101720. http://dx.doi.org/10.1016/j.comgeo.2020.101720.
Повний текст джерелаUehara, Ryuhei. "Tractabilities and Intractabilities on Geometric Intersection Graphs." Algorithms 6, no. 1 (January 25, 2013): 60–83. http://dx.doi.org/10.3390/a6010060.
Повний текст джерелаErlebach, Thomas, and Jiri Fiala. "On-line coloring of geometric intersection graphs." Computational Geometry 23, no. 2 (September 2002): 243–55. http://dx.doi.org/10.1016/s0925-7721(02)00089-5.
Повний текст джерелаTokunaga, Shin-ichi. "Intersection number of two connected geometric graphs." Information Processing Letters 59, no. 6 (September 1996): 331–33. http://dx.doi.org/10.1016/0020-0190(96)00124-x.
Повний текст джерелаErlebach, Thomas, Klaus Jansen, and Eike Seidel. "Polynomial-Time Approximation Schemes for Geometric Intersection Graphs." SIAM Journal on Computing 34, no. 6 (January 2005): 1302–23. http://dx.doi.org/10.1137/s0097539702402676.
Повний текст джерелаAgnarsson, Geir, Peter Damaschke, and Magnús M. Halldórsson. "Powers of geometric intersection graphs and dispersion algorithms." Discrete Applied Mathematics 132, no. 1-3 (October 2003): 3–16. http://dx.doi.org/10.1016/s0166-218x(03)00386-x.
Повний текст джерелаde Berg, Mark, Sándor Kisfaludi-Bak, and Gerhard Woeginger. "The complexity of Dominating Set in geometric intersection graphs." Theoretical Computer Science 769 (May 2019): 18–31. http://dx.doi.org/10.1016/j.tcs.2018.10.007.
Повний текст джерелаДисертації з теми "Geometric Intersection Graphs"
Hoffmann, Udo [Verfasser], Stefan [Akademischer Betreuer] Felsner, Stefan [Gutachter] Felsner, Wolfgang [Gutachter] Mulzer, and Jean [Gutachter] Cardinal. "Intersection graphs and geometric objects in the plane / Udo Hoffmann ; Gutachter: Stefan Felsner, Wolfgang Mulzer, Jean Cardinal ; Betreuer: Stefan Felsner." Berlin : Technische Universität Berlin, 2016. http://d-nb.info/1156014530/34.
Повний текст джерелаKim, Minho. "Finding intersection curves using subdividable linear efficient function enclosures." [Gainesville, Fla.] : University of Florida, 2004. http://purl.fcla.edu/fcla/etd/UFE0005702.
Повний текст джерелаVodah, Sunday. "On the primarity of some block intersection graphs." University of the Western Cape, 2018. http://hdl.handle.net/11394/6735.
Повний текст джерелаA tactical con guration consists of a nite set V of points, a nite set B of blocks and an incidence relation between them, so that all blocks are incident with the same number k points, and all points are incident with the same number r of blocks (See [14] for example ). If v := jV j and b := jBj; then v; k; b; r are known as the parameters of the con guration. Counting incident point-block pairs, one sees that vr = bk: In this thesis, we generalize tactical con gurations on Steiner triple systems obtained from projective geometry. Our objects are subgeometries as blocks. These subgeometries are collected into systems and we study them as designs and graphs. Considered recursively is a further tactical con guration on some of the designs obtained and in what follows, we obtain similar structures as the Steiner triple systems from projective geometry. We also study these subgeometries as factorizations and examine the automorphism group of the new structures. These tactical con gurations at rst sight do not form interesting structures. However, as will be shown, they o er some level of intriguing symmetries. It will be shown that they inherit the automorphism group of the parent geometry.
Jia, Jinyuan. "Revolute quadric decomposition of special surfaces and its application to their intersection problems /." View abstract or full-text, 2004. http://library.ust.hk/cgi/db/thesis.pl?COMP%202004%20JIA.
Повний текст джерелаIncludes bibliographical references (leaves 156-168). Also available in electronic version. Access restricted to campus users.
Burkhart, Craig. "Approval Voting Theory with Multiple Levels of Approval." Scholarship @ Claremont, 2012. https://scholarship.claremont.edu/hmc_theses/26.
Повний текст джерелаJoshi, Utkarsh. "Fast Algorithms for Max Cut on Geometric Intersection Graphs." Thesis, 2022. https://etd.iisc.ac.in/handle/2005/5883.
Повний текст джерелаJedličková, Nikola. "Algoritmické otázky průnikových tříd grafů." Master's thesis, 2019. http://www.nusl.cz/ntk/nusl-405305.
Повний текст джерелаZeman, Peter. "Algebraické, strukturální a výpočetní vlastnosti geometrických reprezentací grafů." Master's thesis, 2016. http://www.nusl.cz/ntk/nusl-352783.
Повний текст джерелаLafreniere, Benjamin J. "Packing Unit Disks." Thesis, 2008. http://hdl.handle.net/10012/3907.
Повний текст джерелаКниги з теми "Geometric Intersection Graphs"
Alberto, Corso, and Polini Claudia 1966-, eds. Commutative algebra and its connections to geometry: Pan-American Advanced Studies Institute, August 3--14, 2009, Universidade Federal de Pernambuco, Olinda, Brazil. Providence, R.I: American Mathematical Society, 2011.
Знайти повний текст джерелаЧастини книг з теми "Geometric Intersection Graphs"
Grigoriev, Alexander, Athanassios Koutsonas, and Dimitrios M. Thilikos. "Bidimensionality of Geometric Intersection Graphs." In SOFSEM 2014: Theory and Practice of Computer Science, 293–305. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-04298-5_26.
Повний текст джерелаErlebach, Thomas, and Erik Jan van Leeuwen. "Domination in Geometric Intersection Graphs." In Lecture Notes in Computer Science, 747–58. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-78773-0_64.
Повний текст джерелаDamaschke, Peter. "Efficient Dispersion Algorithms for Geometric Intersection Graphs." In Graph-Theoretic Concepts in Computer Science, 107–15. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-40064-8_11.
Повний текст джерелаJana, Satyabrata, Anil Maheshwari, Saeed Mehrabi, and Sasanka Roy. "Maximum Bipartite Subgraph of Geometric Intersection Graphs." In WALCOM: Algorithms and Computation, 158–69. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-39881-1_14.
Повний текст джерелаKisfaludi-Bak, Sándor, Karolina Okrasa, and Paweł Rzążewski. "Computing List Homomorphisms in Geometric Intersection Graphs." In Graph-Theoretic Concepts in Computer Science, 313–27. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-15914-5_23.
Повний текст джерелаKratochvíl, Jan, and Martin Pergel. "Geometric Intersection Graphs: Do Short Cycles Help?" In Lecture Notes in Computer Science, 118–28. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-73545-8_14.
Повний текст джерелаBhore, Sujoy, Satyabrata Jana, Supantha Pandit, and Sasanka Roy. "Balanced Connected Subgraph Problem in Geometric Intersection Graphs." In Combinatorial Optimization and Applications, 56–68. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-36412-0_5.
Повний текст джерелаChan, Timothy M., and Dimitrios Skrepetos. "All-Pairs Shortest Paths in Geometric Intersection Graphs." In Lecture Notes in Computer Science, 253–64. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-62127-2_22.
Повний текст джерелаAgnarsson, Geir, Peter Damaschke, and Magnús M. Halldórsson. "Powers of Geometric Intersection Graphs and Dispersion Algorithms." In Algorithm Theory — SWAT 2002, 140–49. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45471-3_15.
Повний текст джерелаKeller, Chaya, and Shakhar Smorodinsky. "Conflict-Free Coloring of Intersection Graphs of Geometric Objects." In Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2397–411. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2018. http://dx.doi.org/10.1137/1.9781611975031.154.
Повний текст джерелаТези доповідей конференцій з теми "Geometric Intersection Graphs"
Kumar, Rajeev, P. K. Singh, and Bhargab B. Bhattacharya. "Biobjective evolutionary and heuristic algorithms for intersection of geometric graphs." In the 8th annual conference. New York, New York, USA: ACM Press, 2006. http://dx.doi.org/10.1145/1143997.1144274.
Повний текст джерелаFox, Jacob, and János Pach. "Coloring kk-free intersection graphs of geometric objects in the plane." In the twenty-fourth annual symposium. New York, New York, USA: ACM Press, 2008. http://dx.doi.org/10.1145/1377676.1377735.
Повний текст джерелаde Berg, Mark, Hans L. Bodlaender, Sándor Kisfaludi-Bak, Dániel Marx, and Tom C. van der Zanden. "A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs." In STOC '18: Symposium on Theory of Computing. New York, NY, USA: ACM, 2018. http://dx.doi.org/10.1145/3188745.3188854.
Повний текст джерелаKumar, Rajeev, P. K. Singh, and Bhargab B. Bhattacharya. "A Local Search Heuristic for Biobjective Intersecting Geometric Graphs." In 2007 International Conference on Computing: Theory and Applications (ICCTA'07). IEEE, 2007. http://dx.doi.org/10.1109/iccta.2007.10.
Повний текст джерелаShah, Jami J., and Bing-Chun Zhang. "Attributed Graph Model for Geometric Tolerancing." In ASME 1992 Design Technical Conferences. American Society of Mechanical Engineers, 1992. http://dx.doi.org/10.1115/detc1992-0158.
Повний текст джерелаLesnova, Elena, and Denis Voloshinov. "The Algorithm for Crossing the N-dimensional Hyperquadric with N-1-dimensional Hyperspace." In 31th International Conference on Computer Graphics and Vision. Keldysh Institute of Applied Mathematics, 2021. http://dx.doi.org/10.20948/graphicon-2021-3027-739-744.
Повний текст джерелаPeng, Xiaobo, and Derek Yip-Hoi. "R*-Tree Localization for Polyhedral Model Based Cutter/Workpiece Engagements Calculations in Milling." In ASME 2007 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2007. http://dx.doi.org/10.1115/detc2007-34367.
Повний текст джерелаShyamsundar, N., and Rajit Gadh. "Geometric Abstractions to Support Contact Based Disassembly Evaluation." In ASME 1997 Design Engineering Technical Conferences. American Society of Mechanical Engineers, 1997. http://dx.doi.org/10.1115/detc97/dac-3972.
Повний текст джерелаMasoudi, Nafiseh, and Georges Fadel. "A Geometric Path-Planning Algorithm in Cluttered Planar Environments Using Convex Hulls." In ASME 2018 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2018. http://dx.doi.org/10.1115/detc2018-85384.
Повний текст джерелаErdim, Hu¨seyin, and Horea Ilies¸. "A Point Membership Classification for Sweeping Solids." In ASME 2007 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2007. http://dx.doi.org/10.1115/detc2007-34827.
Повний текст джерела