ScienceOpen:
research and publishing network
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
My ScienceOpen
Sign in
Register
Dashboard
Blog
About
Search
Advanced search
My ScienceOpen
Sign in
Register
Dashboard
Search
Search
Advanced search
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
Blog
About
2
views
21
references
Top references
cited by
7
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
2,511
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Graph-Theoretic Concepts in Computer Science
The Optimal Cost Chromatic Partition problem for trees and interval graphs
other
Author(s):
Leo G. Kroon
,
Arunabha Sen
,
Haiyong Deng
,
Asim Roy
Publication date
(Online):
June 3 2005
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
General Collective Intelligence Platforms and Hive Minds
Most cited references
21
Record
: found
Abstract
: not found
Article
: not found
On certain polytopes associated with graphs
V. Chvátal
(1975)
0
comments
Cited
68
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
The Complexity of Coloring Circular Arcs and Chords
G L Miller
,
M. Garey
,
C. Papadimitriou
…
(1980)
0
comments
Cited
26
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Book
: not found
Geometric Algorithms and Combinatorial Optimization
Martin Grötschel
,
László Miklós Lovász
,
Alexander Schrijver
(1988)
0
comments
Cited
22
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
1997
Publication date (Online):
June 3 2005
Pages
: 279-292
DOI:
10.1007/3-540-62559-3_23
SO-VID:
a5ea44f5-aeac-4878-956d-45e28332dbd6
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 151
Efficient algorithms for shortest path queries in planar digraphs
pp. 166
LexBFS-orderings and powers of graphs
pp. 279
The Optimal Cost Chromatic Partition problem for trees and interval graphs
Similar content
2,511
Inhibition of Pitting Corrosion on Aluminum Alloy 2024-T3: Effect of Soluble Chromate Additions vs Chromate Conversion Coating
Authors:
G. O. Ilevbare
,
J. Scully
,
J Yuan
…
Controlling the Chromaticity of Small-Molecule Light-Emitting Electrochemical Cells Based on TIPS-Pentacene
Authors:
Michael D. Weber
,
Matthias Adam
,
Rik R Tykwinski
…
Induction of micronucleated reticulocytes by potassium bromate and potassium chromate in CD-1 male mice
Authors:
T. AWOGI
,
K. MURATA
,
M. UEJIMA
…
See all similar
Cited by
7
Interval scheduling: A survey
Authors:
Christos Papadimitriou
,
Frits Spieksma
,
Antoon W.J. Kolen
…
Storage Assignment with Rack-Moving Mobile Robots in KIVA Warehouses
Authors:
Felix Weidinger
,
Nils Boysen
,
Dirk Briskorn
On the approximability of an interval scheduling problem
Authors:
Frits C. R. Spieksma
See all cited by