Log in

Relevant bibliographies by topics / Geometric Intersection Graphs

Contents

Journal articles

Academic literature on the topic 'Geometric Intersection Graphs'

Author: Grafiati

Published: 6 September 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Geometric Intersection Graphs.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Geometric Intersection Graphs"

1

Fekete, Sándor P., and Phillip Keldenich. "Conflict-Free Coloring of Intersection Graphs." International Journal of Computational Geometry & Applications 28, no. 03 (2018): 289–307. http://dx.doi.org/10.1142/s0218195918500085.

Full text

Abstract:

A conflict-free[Formula: see text]-coloring of a graph [Formula: see text] assigns one of [Formula: see text] different colors to some of the vertices such that, for every vertex [Formula: see text], there is a color that is assigned to exactly one vertex among [Formula: see text] and [Formula: see text]’s neighbors. Such colorings have applications in wireless networking, robotics, and geometry, and are well studied in graph theory. Here we study the conflict-free coloring of geometric intersection graphs. We demonstrate that the intersection graph of [Formula: see text] geometric objects wit

APA, Harvard, Vancouver, ISO, and other styles

2

Baste, Julien, and Dimitrios M. Thilikos. "Contraction Bidimensionality of Geometric Intersection Graphs." Algorithmica 84, no. 2 (2022): 510–31. http://dx.doi.org/10.1007/s00453-021-00912-w.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Eppstein, David. "Testing bipartiteness of geometric intersection graphs." ACM Transactions on Algorithms 5, no. 2 (2009): 1–35. http://dx.doi.org/10.1145/1497290.1497291.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Uehara, Ryuhei. "Tractabilities and Intractabilities on Geometric Intersection Graphs." Algorithms 6, no. 1 (2013): 60–83. http://dx.doi.org/10.3390/a6010060.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Erlebach, Thomas, and Jiri Fiala. "On-line coloring of geometric intersection graphs." Computational Geometry 23, no. 2 (2002): 243–55. http://dx.doi.org/10.1016/s0925-7721(02)00089-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Tokunaga, Shin-ichi. "Intersection number of two connected geometric graphs." Information Processing Letters 59, no. 6 (1996): 331–33. http://dx.doi.org/10.1016/0020-0190(96)00124-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Erlebach, Thomas, Klaus Jansen, and Eike Seidel. "Polynomial-Time Approximation Schemes for Geometric Intersection Graphs." SIAM Journal on Computing 34, no. 6 (2005): 1302–23. http://dx.doi.org/10.1137/s0097539702402676.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

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 (2003): 3–16. http://dx.doi.org/10.1016/s0166-218x(03)00386-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!