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
18
Palios, L.
6
Asdre, K.
3
Danielopoulos, S. D.
2
Ioannidou, K.
2
Papadopoulos, C.
2
Rondogiannis, P.
1
Chong, K. W.
1
Fragopoulou, P.
1
Koukopoulos, D.
1
Mertzios, G. B.
.
next >
Subject
4
linear-time algorithms
4
perfectly orderable graph
3
combinatorial problems
3
comparability
3
efficient
3
finding hamiltonian circuits
3
fixed-endpoint path cover
3
graph partition
3
interval graphs
3
path cover
.
< previous
next >
Date
3
2010 - 2011
29
2000 - 2009
4
1994 - 1999
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
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 36 (Search time: 0.051 seconds).
previous
1
2
3
4
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)
Maximizing the number of spanning trees in K(n)-complements of asteroidal graphs (Journal article)
Parallel Computation of Perfect Elimination Schemes Using Partition Techniques on Triangulated Graphs (Journal article)
The Longest Path Problem has a Polynomial Solution on Interval Graphs (Journal article)
On the number of spanning trees of multi-star related graphs (Journal article)
Recognizing cographs and threshold graphs through a classification of their edges (Journal article)
Multi-source trees: Algorithms for minimizing eccentricity cost metrics (Journal article)
Efficient parallel recognition of cographs (Journal article)