Search
for Author
All Reviews
Navon, Barak
Options:
All Media Types
Journals
Proceedings
Div Books
Whole Books
Other
Date Reviewed
Title
Author
Publisher
Published Date
Descending
Ascending
Date Reviewed
1
-
1
of
1
reviews
Parameterized complexity of critical node cuts
Hermelin D., Kaspi M., Komusiewicz C., Navon B. Theoretical Computer Science 651(C): 62-75, 2016. Type: Article
The critical node cut (CNC) problem is defined as follows: given an (undirected) graph
G
and two integers
k
and
x
, decide if
k
nodes can be removed from
...
Feb 13 2017
Reproduction in whole or in part without permission is prohibited. Copyright 1999-2024 ThinkLoud
®
Terms of Use
|
Privacy Policy