SIGN IN
SIGN UP
Nested temporal networks with alternatives: recognition and tractability
Full Text:
PDF
Buy this Article
Authors:
Roman Barták
Charles University, Prague, Czech Republic
Ondřej Čepek
Charles University, Prague, Czech Republic
Published in:
· Proceeding
SAC '08
Proceedings of the 2008 ACM symposium on Applied computing
ACM
New York, NY
, USA
©2008
table of contents
ISBN: 978-1-59593-753-7
doi>
10.1145/1363686.1363729
2008 Article
Poster
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 10
· Citation Count: 1
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
SAC 2012
Share:
|
Tags:
algorithms
alternatives
complexity
constraints
nonnumerical algorithms and problems
performance
temporal networks
theory
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder