×

Found 48 Documents (Results 1–48)

Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs. (English) Zbl 07498685

Lubiw, Anna (ed.) et al., Algorithms and data structures. 17th international symposium, WADS 2021, virtual event, August 9–11, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12808, 300-314 (2021).
MSC:  68P05 68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Minimum eccentricity shortest paths in some structured graph classes. (English) Zbl 1417.05205

Mayr, Ernst W. (ed.), Graph-theoretic concepts in computer science. 41st international workshop, WG 2015, Garching, Germany, June 17–19, 2015. Revised papers. Berlin: Springer. Lect. Notes Comput. Sci. 9224, 189-202 (2016).
MSC:  05C85 05C38 68Q25
PDFBibTeX XMLCite
Full Text: DOI arXiv

On the minimum eccentricity shortest path problem. (English) Zbl 1373.68265

Dehne, Frank (ed.) et al., Algorithms and data structures. 14th international symposium, WADS 2015, Victoria, BC, Canada, August 5–7, 2015. Proceedings. Cham: Springer (ISBN 978-3-319-21839-7/pbk; 978-3-319-21840-3/ebook). Lecture Notes in Computer Science 9214, 276-288 (2015).
PDFBibTeX XMLCite
Full Text: DOI

An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs. (English) Zbl 1343.05149

Goldberg, Leslie Ann (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 14th international workshop, APPROX 2011, and 15th international workshop, RANDOM 2011, Princeton, NJ, USA, August 17–19, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22934-3/pbk). Lecture Notes in Computer Science 6845, 171-183 (2011).
MSC:  05C85 68W25 68W40
PDFBibTeX XMLCite
Full Text: DOI

Additive spanners for circle graphs and polygonal graphs. (English) Zbl 1202.05024

Broersma, Hajo (ed.) et al., Graph-theoretic concepts in computer science. 34th international workshop, WG 2008, Durham, UK, June 30–July 2, 2008. Revised papers. Berlin: Springer (ISBN 978-3-540-92247-6/pbk). Lecture Notes in Computer Science 5344, 110-121 (2008).
MSC:  05C05 05C62 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Homogeneously orderable graphs and the Steiner tree problem. (English) Zbl 07810381

Nagl, Manfred (ed.), Graph-theoretic concepts in computer science. 21st international workshop, WG ’95, Aachen, Germany, June 20–22, 1995. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 1017, 381-395 (1995).
PDFBibTeX XMLCite
Full Text: DOI

The algorithmic use of hypertree structure and maximum neighbourhood orderings. (English) Zbl 1528.68277

Mayr, Ernst W. (ed.) et al., Graph-theoretic concepts in computer science. 20th international workshop. WG ’94, Herrsching, Germany, June 16–18, 1994. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 903, 65-80 (1995).
MSC:  68R10 05C85 68Q25
PDFBibTeX XMLCite
Full Text: DOI

On Condorcet and median points of simple rectilinear polygons (extended abstract). (English) Zbl 1508.68383

Reichel, Horst (ed.), Fundamentals of computation theory. 10th international conference, FCT’95, Dresden, Germany, August 22–25, 1995. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 965, 181-190 (1995).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI

Dually chordal graphs. (English) Zbl 1528.68278

van Leeuwen, Jan (ed.), WG ’93. Graph-theoretic concepts in computer science, 19th international workshop, Utrecht, the Netherlands, June 16–18, 1993. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 790, 237-251 (1994).
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software