Graph-Theoretic Concepts in Computer Science - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

36
(FIVE YEARS 0)

H-INDEX

4
(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642450426, 9783642450433
Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

scholarly journals Towards a Provably Resilient Scheme for Graph-Based Watermarking

2013 ◽  
pp. 50-63 ◽  
Author(s):  
Lucila Maria Souza Bento ◽  
Davidson Boccardo ◽  
Raphael Carlos Santos Machado ◽  
Vinícius Gusmão Pereira de Sá ◽  
Jayme Luiz Szwarcfiter

Lower and Upper Bounds for Long Induced Paths in 3-Connected Planar Graphs

2013 ◽  
pp. 213-224 ◽  
Author(s):  
Emilio Di Giacomo ◽  
Giuseppe Liotta ◽  
Tamara Mchedlidze
Keyword(s):  
Planar Graphs ◽  
Upper Bounds ◽  
Lower And Upper Bounds

On Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs

2013 ◽  
pp. 345-357 ◽  
Author(s):  
Nathan Lindzey ◽  
Ross M. McConnell

scholarly journals Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs

2013 ◽  
pp. 127-138
Author(s):  
Hajo Broersma ◽  
Jiří Fiala ◽  
Petr A. Golovach ◽  
Tomáš Kaiser ◽  
Daniël Paulusma ◽  
...  
Keyword(s):  
Linear Time ◽  
Interval Graphs ◽  
Linear Time Algorithms

scholarly journals Colouring of Graphs with Ramsey-Type Forbidden Subgraphs

2013 ◽  
pp. 201-212
Author(s):  
Konrad K. Dabrowski ◽  
Petr A. Golovach ◽  
Daniël Paulusma
Keyword(s):  
Forbidden Subgraphs ◽  
Ramsey Type

Tight Upper Bounds for Minimum Feedback Arc Sets of Regular Graphs

2013 ◽  
pp. 298-309
Author(s):  
Kathrin Hanauer ◽  
Franz J. Brandenburg ◽  
Christopher Auer
Keyword(s):  
Upper Bounds ◽  
Regular Graphs

scholarly journals FPT Is Characterized by Useful Obstruction Sets

2013 ◽  
pp. 261-273 ◽  
Author(s):  
Michael R. Fellows ◽  
Bart M. P. Jansen

scholarly journals Thickness and Colorability of Geometric Graphs

2013 ◽  
pp. 237-248 ◽  
Author(s):  
Stephane Durocher ◽  
Ellen Gethner ◽  
Debajyoti Mondal
Keyword(s):  
Geometric Graphs

Rolling Upward Planarity Testing of Strongly Connected Graphs

2013 ◽  
pp. 38-49 ◽  
Author(s):  
Christopher Auer ◽  
Christian Bachmaier ◽  
Franz J. Brandenburg ◽  
Kathrin Hanauer
Keyword(s):  
Connected Graphs ◽  
Strongly Connected ◽  
Upward Planarity
Load More ...
Sign in / Sign up

Export Citation Format

Share Document