Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ Eindhoven University...arrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
Eindhoven University of Technology Research Portal
Report . 1993
Data sources: Eindhoven University of Technology Research Portal
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
zbMATH Open
Article
Data sources: zbMATH Open
https://doi.org/10.1007/3-540-...
Part of book or chapter of book . 1993 . Peer-reviewed
Data sources: Crossref
International Journal of Foundations of Computer Science
Article . 1996 . Peer-reviewed
Data sources: Crossref
Eindhoven University of Technology Research Portal
Conference object . 1993
Data sources: Eindhoven University of Technology Research Portal
Pure Utrecht University
Report . 1993
Data sources: Pure Utrecht University
International Journal of Foundations of Computer Science
Article
Data sources: Microsoft Academic Graph
https://core.ac.uk/display/158...
Article
Data sources: Microsoft Academic Graph
 View all 6 versions
Claim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

Treewidth of circle graphs

descriptionPublicationkeyboard_double_arrow_right Part of book or chapter of book , Article , Report , Conference object 01 Jan 1993 Netherlands Publisher:Springer Berlin HeidelbergJournal:International Journal of Foundations of Computer Science, volume 7, pages 111-120 (issn: 0129-0541, eissn: 1793-6373, Copyright policy )
Authors: Ton Kloks;

doi: 10.1007/3-540-57568-5_240 , 10.1142/s0129054196000099

Treewidth of circle graphs

Abstract

In this paper we show that the treewidth of a circle graph can be computed in polynomial time. A circle graph is a graph that is isomorphic to the intersection graph of a finite collection of chords of a circle. The TREEWIDTH problem can be viewed upon as the problem of finding a chordal embedding of the graph that minimizes the clique number. Our algorithm to determine the treewidth of a circle graph can be implemented to run in O(n3) time, where n is the number of vertices of the graph.

Country
Netherlands
Related Organizations
Keywords

Landbouwwetenschappen, Informatica, Natuurwetenschappen, Graph theory (including graph drawing) in computer science, Analysis of algorithms and problem complexity, treewidth, Wiskunde en Informatica (WIIN), circle graph, Mathematics

  • BIP!
    Impact byBIP!
    citations
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    		 33
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    		 Top 10%
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    		 Top 10%
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    		 Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
citations
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
33
Top 10%
Top 10%
Average
Related to Research communities
Netherlands Research Portal