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
2
Nikolopoulos, S. D.
2
Papadopoulos, C.
1
Palios, L.
Subject
1
algorithms
1
cographs
1
combinatorial problems
1
complement-spanning-tree matrix
1
complexity
1
interconnection networks
1
maximization
1
modular decomposition
1
number
1
number of spanning trees
.
next >
Item Type
2
journalArticle
Date
2
2009
Search
Search:
All of DSpace
ΑΠΟΘΕΤΗΡΙΟ "ΟΛΥΜΠΙΑΣ"
Σχολή Θετικών Επιστημών
Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικής
Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά)
Άρθρα σε επιστημονικά περιοδικά (Κλειστά)
Διατριβές Μεταπτυχιακής Έρευνας (Masters) - ΜΥ
Διδακτορικές Διατριβές
Μονογραφίες ( Ανοικτές)
Μονογραφίες ( Κλειστές)
Ομιλίες σε Συνέδριο
Σημειώσεις Μαθημάτων
Φοιτητικές Εργασίες
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-2 of 2 (Search time: 0.003 seconds).
previous
1
next
Counting Spanning Trees in Cographs: An Algorithmic Approach (Journal article)
Maximizing the number of spanning trees in K(n)-complements of asteroidal graphs (Journal article)