Skip navigation
Home
Browse
Communities
& Collections
Browse Items by:
Issue Date
Author
Title
Subject
Item Type
Advanced Search
Help
About DSpace
Sign on to:
My DSpace
Receive email
updates
Edit Profile
Saved Searches
Favorites
Repository of UOI "Olympias"
Repository of OAI
Saved Searches
Save this search
Go!
Discover
Author
12
Nikolopoulos, S. D.
5
Palios, L.
4
Asdre, K.
1
Ioannidou, K.
1
Papadopoulos, C.
Subject
7
perfect graphs
7
recognition algorithm
4
algorithm
4
complexity
4
parallel algorithms
3
fixed-endpoint path cover
3
linear-time algorithms
3
path cover
3
recognition
2
circular-arc graphs
.
next >
Item Type
12
journalArticle
Date
2
2010
1
2009
2
2007
1
2006
3
2005
.
next >
Search
Search:
All of DSpace
ΑΠΟΘΕΤΗΡΙΟ "ΟΛΥΜΠΙΑΣ"
Σχολή Θετικών Επιστημών
Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικής
Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά)
for
Search only items with full text availability
Current filters:
Title
Author
Subject
Date Issued
Item Type
Date
Has File(s)
???jsp.search.filter.original_bundle_filenames???
???jsp.search.filter.original_bundle_descriptions???
Equals
Contains
ID
Not Equals
Not Contains
Not ID
Clear current filters
or
Add more filters
Title
Author
Subject
Date Issued
Item Type
Date
Has File(s)
???jsp.search.filter.original_bundle_filenames???
???jsp.search.filter.original_bundle_descriptions???
Equals
Contains
ID
Not Equals
Not Contains
Not ID
View Option
Results/Page
5
10
15
20
25
30
35
40
45
50
55
60
65
70
75
80
85
90
95
100
Sort items by
Relevance
Title
Issue Date
In order
Ascending
Descending
Authors/record
All
1
5
10
15
20
25
30
35
40
45
50
Results 1-10 of 12 (Search time: 0.003 seconds).
previous
1
2
next
The 1-Fixed-Endpoint Path Cover Problem is Polynomial on Interval Graphs (Journal article)
Counting Spanning Trees in Cographs: An Algorithmic Approach (Journal article)
A polynomial solution to the k-fixed-endpoint path cover problem on proper interval graphs (Journal article)
Recognizing cographs and threshold graphs through a classification of their edges (Journal article)
Efficient parallel recognition of cographs (Journal article)
Maximum-size subgraphs of P4-sparse graphs admitting a perfect matching (Journal article)
A linear-time algorithm for the k-fixed-endpoint path cover problem on cographs (Journal article)
The harmonious coloring problem is NP-complete for interval and permutation graphs (Journal article)
Adding an edge in a cograph (Journal article)
Minimal separators in P-4-sparse graphs (Journal article)