Complexity Note on Mixed Hypergraphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F01%3A00105448" target="_blank" >RIV/00216208:11320/01:00105448 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Complexity Note on Mixed Hypergraphs
Original language description
We study mixed hypergraphs with bounded degree and complexity of determining gap-freenes of feasibel sets of general mixed hypergraphs.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2001
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Mathematical Foundations of Computer Science 2001, 26th International Symposium
ISBN
3-540-42496-2
ISSN
—
e-ISSN
—
Number of pages
13
Pages from-to
474-486
Publisher name
Springer
Place of publication
Heidelberg
Event location
Heidelberg
Event date
Jan 1, 2001
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—