Results 31 to 40 of about 617,805 (269)
An Automat for the semantic processing of structured information [PDF]
, 2009 Using the database of the PuertoTerm project, an indexing system based on the cognitive model of Brigitte Enders was built. By analyzing the cognitive strategies of three abstractors, we built an automat that serves to simulate human indexing processes ...
Leiva-Mederos, Amed +3 more
core +2 more sources
European Journal of Combinatorics, 1996 Graphs that are obtained from single edges and even cycles by successive amalgamations are called cellular graphs. Especially cellular bipartite graphs are investigated in this paper. Since graphs with their shortest-path metrics are particular instances of finite metric spaces, these investigations are done from a metric point of view.
Hans-Jürgen Bandelt, Victor Chepoi
openaire +1 more source
Decomposition of complete graphs into small graphs [PDF]
Opuscula Mathematica, 2010 In 1967, A. Rosa proved that if a bipartite graph \(G\) with \(n\) edges has an \(\alpha\)-labeling, then for any positive integer \(p\) the complete graph \(K_{2np+1}\) can be cyclically decomposed into copies of \(G\).
Dalibor Froncek
doaj +1 more source
A Tabu Search Based Approach for Graph Layout [PDF]
, 2014 This paper describes an automated tabu search based method for drawing general graph layouts with straight lines. To our knowledge, this is the first time tabu methods have been applied to graph drawing.
Rodgers, Peter, Dib, Fadi
core +2 more sources
Bipartite embedding of (p,q)-trees [PDF]
Opuscula Mathematica, 2006 A bipartite graph \(G=(L,R;E)\) where \(V(G)=L\cup R\), \(|L|=p\), \(|R| =q\) is called a \((p,q)\)-tree if \(|E(G)|=p+q-1\) and \(G\) has no cycles. A bipartite graph \(G=(L,R;E)\) is a subgraph of a bipartite graph \(H=(L',R';E')\) if \(L\subseteq L'\)
Beata Orchel
doaj
Network Structure Personalized Recommendation Method Based on Social Tag and Historical Price Curve [PDF]
Jisuanji gongcheng, 2017 Social tag contains rich content of commodity and reflects user’s personal preference for commodity.Historical price curve of commodity impacts user’s purchase-tendency.Therefore,this paper proposes a personalized recommendation method based on social ...
LING Xiao’e
doaj +1 more source
Dynamic Load Balancing Algorithm Based on Optimal Matching of Weighted Bipartite Graph
IEEE Access, 2022 When the server cluster is processing concurrent task requests, if the performance difference among servers is not fully considered, task allocation will be unreasonable, which will lead to an increase in task making span and a decrease in cluster ...
Wei Hou +3 more
doaj +1 more source
The Median Problem on k-Partite Graphs
Discussiones Mathematicae Graph Theory, 2015 In a connected graph G, the status of a vertex is the sum of the distances of that vertex to each of the other vertices in G. The subgraph induced by the vertices of minimum (maximum) status in G is called the median (anti-median) of G.
Pravas Karuvachery, Vijayakumar Ambat
doaj +1 more source
Detecting and generating overlapping nested communities
Applied Network Science, 2023 Nestedness has been observed in a variety of networks but has been primarily viewed in the context of bipartite networks. Numerous metrics quantify nestedness and some clustering methods identify fully nested parts of graphs, but all with similar ...
Imre Gera, András London
doaj +1 more source
Discrete Applied Mathematics, 1984 The isoperimetric constant \(i(G)\) of a cubic graph \(G\) is \(i(G)=\min | \partial U| /| U|\) where \(|\cdot|\) is cardinality, \(U\) runs over all subsets of the vertex set \(VG\) satisfying \(| U| \leq \frac12 | VG|\), and \(| \partial U|\) is the number of edges running from \(U\) to the complement \(VG\backslash U\).
openaire +2 more sources