×

Found 52 Documents (Results 1–52)

Strong triadic closure in cographs and graphs of low maximum degree. (English) Zbl 1434.68363

Cao, Yixin (ed.) et al., Computing and combinatorics. 23rd international conference, COCOON 2017, Hong Kong, China, August 3–5, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10392, 346-358 (2017).
PDFBibTeX XMLCite
Full Text: DOI

Counting spanning trees in graphs using modular decomposition. (English) Zbl 1318.05082

Katoh, Naoki (ed.) et al., WALCOM: Algorithms and computation. 5th international workshop, WALCOM 2011, New Delhi, India, February 18–20, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-19093-3/pbk). Lecture Notes in Computer Science 6552, 202-213 (2011).
MSC:  05C85 05C05 05C30
PDFBibTeX XMLCite
Full Text: DOI

The longest path problem is polynomial on cocomparability graphs. (English) Zbl 1308.68065

Thilikos, Dimitrios M. (ed.), Graph theoretic concepts in computer science. 36th international workshop, WG 2010, Zarós, Crete, Greece, June 28–30, 2010. Revised papers. Berlin: Springer (ISBN 978-3-642-16925-0/pbk). Lecture Notes in Computer Science 6410, 27-38 (2010).
MSC:  68Q25 05C38 05C85
PDFBibTeX XMLCite
Full Text: DOI

Harmonious coloring on subclasses of colinear graphs. (English) Zbl 1274.05163

Rahman, Md. Saidur (ed.) et al., WALCOM: Algorithms and computation. 4th international workshop, WALCOM 2010, Dhaka, Bangladesh, February 10–12, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-11439-7/pbk). Lecture Notes in Computer Science 5942, 136-148 (2010).
MSC:  05C15 05C85 68Q17
PDFBibTeX XMLCite
Full Text: DOI

An \(O(n)\)-time algorithm for the paired-domination problem on permutation graphs. (English) Zbl 1267.05267

Fiala, Jiří (ed.) et al., Combinatorial algorithms. 20th international workshop, IWOCA 2009, Hradec nad Moravicí, Czech Republic, June 28–July 2, 2009. Revised selected papers. Berlin: Springer (ISBN 978-3-642-10216-5/pbk). Lecture Notes in Computer Science 5874, 368-379 (2009).
MSC:  05C85 05C69
PDFBibTeX XMLCite
Full Text: DOI

The longest path problem is polynomial on interval graphs. (English) Zbl 1250.68128

Královič, Rastislav (ed.) et al., Mathematical foundations of computer science 2009. 34th international symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24–28, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03815-0/pbk). Lecture Notes in Computer Science 5734, 403-414 (2009).
MSC:  68Q25 05C38 05C85
PDFBibTeX XMLCite
Full Text: DOI Link

Colinear coloring on graphs. (English) Zbl 1211.05041

Das, Sandip (ed.) et al., WALCOM: Algorithms and computation. Third international workshop, WALCOM 2009, Kolkata, India, February 18–20, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-00201-4/pbk). Lecture Notes in Computer Science 5431, 117-128 (2009).
MSC:  05C15 05C85
PDFBibTeX XMLCite
Full Text: DOI

The 2-terminal-set path cover problem and its polynomial solution on cographs. (English) Zbl 1143.68499

Preparata, Franco P. (ed.) et al., Frontiers in algorithmics. Second annual international workshop, FAW 2008, Changsha, China, June 19–21, 2008. Proceeedings. Berlin: Springer (ISBN 978-3-540-69310-9/pbk). Lecture Notes in Computer Science 5059, 208-220 (2008).
MSC:  68R10 05C85 68W05
PDFBibTeX XMLCite
Full Text: DOI

Optimal algorithms for detecting network stability. (English) Zbl 1132.90311

Nakano, Shin-ichi (ed.) et al., WALCOM: Algorithms and computation. Second international workshop, WALCOM 2008, Dhaka, Bangladesh, February 7–8, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-77890-5/pbk). Lecture Notes in Computer Science 4921, 188-199 (2008).
MSC:  90B18 90B22 68W05
PDFBibTeX XMLCite
Full Text: DOI

An \(O(nm)\)-time certifying algorithm for recognizing HHD-free graphs. (English) Zbl 1214.05164

Preparata, Franco P. (ed.) et al., Frontiers in algorithmics. First annual international workshop, FAW 2007, Lanzhou, China, August 1–3, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-73813-8). Lecture Notes in Computer Science 4613, 281-292 (2007).
MSC:  05C85 68Q25
PDFBibTeX XMLCite
Full Text: DOI

A fully dynamic algorithm for the recognition of \(P_{4}\)-sparse graphs. (English) Zbl 1167.05337

Fomin, Fedor V. (ed.), Graph-theoretic concepts in computer science. 32nd international workshop, WG 2006, Bergen, Norway, June 22–24, 2006. Revised papers. Berlin: Springer (ISBN 978-3-540-48381-6/pbk). Lecture Notes in Computer Science 4271, 256-268 (2006).
MSC:  05C85 68Q25 68R10
PDFBibTeX XMLCite
Full Text: DOI

Multi-source trees: Algorithms for minimizing eccentricity cost metrics. (English) Zbl 1175.05126

Deng, Xiaotie (ed.) et al., Algorithms and computation. 16th international symposium, ISAAC 2005, Sanya, Hainan, China, December 19–21, 2005. Proceedings. Berlin: Springer (ISBN 3-540-30935-7/pbk). Lecture Notes in Computer Science 3827, 1080-1089 (2005).
PDFBibTeX XMLCite
Full Text: DOI

Recognizing HHDS-free graphs. (English) Zbl 1123.68096

Kratsch, Dieter (ed.), Graph-theoretic concepts in computer science. 31st international workshop, WG 2005, Metz, France, June 23–25, 2005. Revised selected papers. Berlin: Springer (ISBN 3-540-31000-2/pbk). Lecture Notes in Computer Science 3787, 456-467 (2005).
PDFBibTeX XMLCite
Full Text: DOI

Adding an edge in a cograph. (English) Zbl 1171.68635

Kratsch, Dieter (ed.), Graph-theoretic concepts in computer science. 31st international workshop, WG 2005, Metz, France, June 23–25, 2005. Revised selected papers. Berlin: Springer (ISBN 3-540-31000-2/pbk). Lecture Notes in Computer Science 3787, 214-226 (2005).
PDFBibTeX XMLCite
Full Text: DOI

Hole and antihole detection in graphs. (English) Zbl 1318.05081

Proceedings of the fifteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2004, New Orleans, LA, USA, January 11–13, 2004. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 0-89871-558-X). 850-859 (2004).
MSC:  05C85 05C40 68Q25
PDFBibTeX XMLCite

Recognizing HHD-free and Welsh-Powell opposition graphs. (English) Zbl 1112.68428

Hromkovič, Juraj (ed.) et al., Graph-theoretic concepts in computer science. 30th international workshop, WG 2004, Bad Honnef, Germany, June 21–23, 2004. Revised papers. Berlin: Springer (ISBN 3-540-24132-9/pbk). Lecture Notes in Computer Science 3353, 105-116 (2004).
MSC:  68R10 05C85
PDFBibTeX XMLCite
Full Text: DOI

The number of spanning trees in \(P_4\)-reducible graphs. (English) Zbl 1060.05089

Drmota, Michael (ed.) et al., Mathematics and computer science III. Algorithms, trees, combinatorics and probabilities. Proceedings of the international colloquium of mathematics and computer sciences, Vienna, September 13–17, 2004. Basel: Birkhäuser (ISBN 3-7643-7128-5/hbk). Trends in Mathematics, 141-143 (2004).
MSC:  05C85 05C30 05C05
PDFBibTeX XMLCite

Recognizing bipolarizable and \(P _{4}\)-simplicial graphs. (English) Zbl 1255.05189

Bodlaender, Hans L. (ed.), Graph-theoretic concepts in computer science. 29th international workshop, WG 2003, Elspeet, The Netherlands, June 19–21, 2003. Revised papers. Berlin: Springer (ISBN 3-540-20452-0/pbk). Lect. Notes Comput. Sci. 2880, 358-369 (2003).
MSC:  05C85 05C75 68Q25
PDFBibTeX XMLCite
Full Text: DOI

On the recognition of \(P_4\)-comparability graphs. (English) Zbl 1022.68602

Kučera, Luděk (ed.), Graph-theoretic concepts in computer science. 28th international workshop, WG 2002, Český Krumlov, Czech Republic, June 13-15, 2002. Revised papers. Berlin: Springer. Lect. Notes Comput. Sci. 2573, 355-366 (2002).
MSC:  68R10 05C85 68Q25
PDFBibTeX XMLCite
Full Text: Link

Recognition and orientation algorithms for \(P_4\)-comparability graphs. (English) Zbl 1077.05514

Eades, Peter (ed.) et al., Algorithms and computation. 12th international symposium, ISAAC 2001, Christchurch, New Zealand, December 19–21, 2001. Proceedings. Berlin: Springer (ISBN 3-540-42985-9). Lect. Notes Comput. Sci. 2223, 320-331 (2001).
PDFBibTeX XMLCite
Full Text: Link

Filter Results by …

Document Type

all top 5

Year of Publication

Main Field