Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection

Permanent URI for this collectionhttps://hdl.handle.net/11147/7148

Browse

Filters

2004 - 200932010 - 20121

Settings

Subject: search.filters.subject.Graph theoryWoS Q: search.filters.wosQuartile.N/A

Search Results

Now showing 1 - 4 of 4
  • Conference Object
    Citation - Scopus: 7
    New Mathematical Model for Finding Minimum Vertex Cut Set
    (Institute of Electrical and Electronics Engineers Inc., 2012) Beşeri Sevim, Tina; Kutucu, Hakan; Berberler, Murat Erşen
    In this paper, we consider the vertex separator problem. Given an undirected graph G, the vertex separator problem consists in identifying a minimum number of vertex set whose removal disconnects G. We present a new mathematical model for solving this problem and also present computational results on graphs with various density. © 2012 IEEE.
  • Conference Object
    Citation - WoS: 3
    Citation - Scopus: 5
    Serial and Parallel Multilevel Graph Partitioning Using Fixed Centers
    (Springer Verlag, 2005) Erciyeş, Kayhan; Alp, Ali; Marshall, Geoffrey
    We present new serial and parallel algorithms for multilevel graph partitioning. Our algorithm has coarsening, partitioning and uncoarsening phases like other multilevel partitioning methods. However, we choose fixed nodes which are at least a specified distance away from each other and coarsen them with their neighbor nodes in the coarsening phase using various heuristics. Using this algorithm, it is possible to obtain theoretically and experimentally much more balanced partitions with substantially decreased total edge costs between the partitions than other algorithms. We also developed a parallel method for the fixed centered partitioning algorithm. It is shown that parallel fixed centered partitioning obtains significant speedups compared to the serial case.
  • Conference Object
    Citation - WoS: 1
    Citation - Scopus: 2
    Applications of Graph Coloring
    (Springer Verlag, 2005) Ufuktepe, Ünal; Bacak, Gökşen
    A graph G is a mathematical structure consisting of two sets V(G) (vertices of G) and E(G) (edges of G). Proper coloring of a graph is an assignment of colors either to the vertices of the graphs, or to the edges, in such a way that adjacent vertices / edges are colored differently. This paper discusses coloring and operations on graphs with Mathematica and webMathematica. We consider many classes of graphs to color with applications. We draw any graph and also try to show whether it has an Eulerian and Hamiltonian cycles by using our package ColorG
  • Article
    Citation - WoS: 1
    Graph Coloring With Webmathematica
    (Springer Verlag, 2004) Ufuktepe, Ünal; Bacak, Gökşen; Beşeri Sevim, Tina
    Coloring of a graph is an assignment of colors either to the edges of the graph G, or to vertices, or to maps in such a way that adjacent edges/vertices/maps are colored differently. We consider the problem of coloring graphs by using webMathematica which is the new web-based technology. In this paper, we describe some web-based interactive examples on graph coloring with webMathematica.