DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE - Journal - Bridge of Knowledge

Search

DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE

ISSN:

1462-7264

eISSN:

1365-8050

Disciplines
(Field of Science):

  • information and communication technology (Engineering and Technology)
  • biomedical engineering (Engineering and Technology)
  • mechanical engineering (Engineering and Technology)
  • computer and information sciences (Natural sciences)
  • mathematics (Natural sciences)

Ministry points: Help

Ministry points - current year
Year Points List
Year 2024 70 Ministry scored journals list 2024
Ministry points - previous years
Year Points List
2024 70 Ministry scored journals list 2024
2023 70 Ministry Scored Journals List
2022 70 Ministry Scored Journals List 2019-2022
2021 70 Ministry Scored Journals List 2019-2022
2020 70 Ministry Scored Journals List 2019-2022
2019 70 Ministry Scored Journals List 2019-2022
2018 20 A
2017 20 A
2016 20 A
2015 20 A
2014 20 A
2013 20 A
2012 20 A
2011 20 A
2010 32 A

Model:

Open Access

Points CiteScore:

Points CiteScore - current year
Year Points
Year 2023 0.9
Points CiteScore - previous years
Year Points
2023 0.9
2022 1.1
2021 1.1
2020 1.4
2019 0.8
2018 1.1
2017 1.1
2016 0.8
2015 0.5
2014 0.3
2013 0.5
2012 0.9
2011 0.9

Impact Factor:

Log in to see the Impact Factor.

Filters

total: 1

  • Category
  • Year
  • Options

clear Chosen catalog filters disabled

Catalog Journals

Year 2013
  • On-line ranking of split graphs

    A vertex ranking of a graph G is an assignment of positive integers (colors) to the vertices of G such that each path connecting two vertices of the same color contains a vertex of a higher color. Our main goal is to find a vertex ranking using as few colors as possible. Considering on-line algorithms for vertex ranking of split graphs, we prove that the worst case ratio of the number of colors used by any on-line ranking algorithm...

    Full text available to download

seen 206 times