
The Library
Bipartite graphs of large clique-width
Tools
Korpelainen, Nicholas and Lozin, Vadim V. (2009) Bipartite graphs of large clique-width. In: 20th International Workshop on Combinatorial Algorithms, Hradec nad Moravici, Czech Republic, June 28-JUL 02, 2009. Published in: Lecture Notes in Computer Science, Vol.5874 pp. 385-395. ISBN 978-3-642-10216-5. ISSN 0302-9743. doi:10.1007/978-3-642-10217-2_38
Research output not available from this repository, contact author.
Official URL: http://dx.doi.org/10.1007/978-3-642-10217-2_38
Abstract
Recently, several constructions of bipartite graphs of large clique-width have been discovered in the literature. In the present paper, we propose a general framework for developing such constructions and use it to obtain new results on this topic.
Item Type: | Conference Item (UNSPECIFIED) | ||||
---|---|---|---|---|---|
Subjects: | Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software | ||||
Divisions: | Faculty of Science > Mathematics | ||||
Series Name: | Lecture Notes in Computer Science | ||||
Journal or Publication Title: | Lecture Notes in Computer Science | ||||
Publisher: | Springer | ||||
ISBN: | 978-3-642-10216-5 | ||||
ISSN: | 0302-9743 | ||||
Editor: | Fiala, J and Kratochvil, J and Miller, M | ||||
Official Date: | 2009 | ||||
Dates: |
|
||||
Volume: | Vol.5874 | ||||
Number of Pages: | 11 | ||||
Page Range: | pp. 385-395 | ||||
DOI: | 10.1007/978-3-642-10217-2_38 | ||||
Status: | Peer Reviewed | ||||
Publication Status: | Published | ||||
Access rights to Published version: | Restricted or Subscription Access | ||||
Title of Event: | 20th International Workshop on Combinatorial Algorithms | ||||
Type of Event: | Conference | ||||
Location of Event: | Hradec nad Moravici, Czech Republic | ||||
Date(s) of Event: | June 28-JUL 02, 2009 |
Data sourced from Thomson Reuters' Web of Knowledge
Request changes or add full text files to a record
Repository staff actions (login required)
![]() |
View Item |