Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
23
views
106
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
3,037
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Graphs and Order
Algorithmic Aspects of Comparability Graphs and Interval Graphs
other
Author(s):
Rolf H. Möhring
Publication date
(Print):
1985
Publisher:
Springer Netherlands
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
ScienceOpen Research
Most cited references
106
Record
: found
Abstract
: not found
Article
: not found
The ellipsoid method and its consequences in combinatorial optimization
M. Grötschel
,
L Lovász
,
A Schrijver
(1981)
0
comments
Cited
262
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
Kellogg S. Booth
,
George S. Lueker
(1976)
0
comments
Cited
192
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Incidence matrices and interval graphs
Delbert Fulkerson
,
Oliver Gross
(1965)
0
comments
Cited
172
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
1985
Pages
: 41-101
DOI:
10.1007/978-94-009-5315-4_2
SO-VID:
9e97ee82-8ba7-46ba-830d-4b66524d091a
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 41
Algorithmic Aspects of Comparability Graphs and Interval Graphs
pp. 487
Basic WQO- and BQO-Theory
Similar content
3,037
An active learning kriging model for hybrid reliability analysis with both random and interval variables
Authors:
Xufeng Yang
,
Yongshou Liu
,
Yi Gao
…
Graph theory network analysis provides brain MRI evidence of a partial continuum of neurodegeneration in patients with UMN-predominant ALS and ALS-FTD
Authors:
Venkateswaran Rajagopalan
,
Erik P Pioro
Multiattribute decision making based on probability density functions and the variances and standard deviations of largest ranges of evaluating interval-valued intuitionistic fuzzy values
Authors:
Shyi-Ming Chen
,
Kang-Yun Fan
See all similar
Cited by
7
Scheduling project networks with resource constraints and time windows
Authors:
M. Bartusch
,
F. Radermacher
,
R. H. Möhring
A branch and bound algorithm for the resource-constrained project scheduling problem
Authors:
Olaf Thiele
,
Arno Schoo
,
Sigrid Knust
…
An Incremental Linear-Time Algorithm for Recognizing Interval Graphs
Authors:
Rolf H. Möhring
,
Norbert Korte
See all cited by