Zobrazeno 1 - 10
of 1 808
pro vyhledávání: '"Simplex graph"'
Autor:
Bohdan Zelinka
Publikováno v:
Discussiones Mathematicae Graph Theory. 18:165
Autor:
Steve Leonard, William Turner
Publikováno v:
JavaScript for Sound Artists ISBN: 9781315659732
JavaScript for Sound Artists: Learn to Code with the Web Audio API
JavaScript for Sound Artists: Learn to Code with the Web Audio API
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::85b1be2580d7e718227d66737119af48
https://doi.org/10.1201/9781003201496-9
https://doi.org/10.1201/9781003201496-9
Autor:
Shibsankar Das, Rahul Kadyan
Publikováno v:
Scientific Annals of Computer Science, Vol XXX, Iss 1, Pp 39-67 (2020)
Let G be an undirected bipartite graph with positive integer weights on the edges. We refine the existing decomposition theorem originally proposed by Kao et al., for computing maximum weight bipartite matching. We apply it to design an efficient ver
Autor:
Kathie Cameron, Chính T. Hoàng
Publikováno v:
Discrete Applied Mathematics. 261:119-122
We give an O ( n 4 ) algorithm to find a minimum clique cover of a (bull, C 4 )-free graph, or equivalently, a minimum colouring of a (bull, 2 K 2 )-free graph, where n is the number of vertices of the graph.
Publikováno v:
IEEE Transactions on Pattern Analysis and Machine Intelligence. 40:2853-2867
Graph matching aims at establishing correspondences between graph elements, and is widely used in many computer vision tasks. Among recently proposed graph matching algorithms, those utilizing the path following strategy have attracted special resear
Autor:
Zhang Ruonan, Wenmin Wang
Publikováno v:
IEEE Transactions on Circuits and Systems for Video Technology. 28:2978-2992
Correspondence problems are challenging due to the complexity of real-world scenes. One way to solve this problem is to improve the graph matching (GM) process, which is flexible for matching non-rigid objects. GM can be classified into three categor
Publikováno v:
Theoretical Computer Science. 734:38-45
Breakpoint graph has been widely used as a key data structure in algorithm design for genome rearrangements. The problem of breakpoint graph cycle decomposition, which asks for a largest collection of edge-disjoint cycles, is crucial in computing rea
Autor:
Shuchao Li, Jing Huang
Publikováno v:
Applied Mathematics and Computation. 320:213-225
The k-triangle graph Tk(G) is obtained from a graph G by replacing each edge in G with k + 1 parallel paths, in which one is of length 1 and each of the rest k paths is of length 2; whereas the k-quadrilateral graph Qk(G) is obtained from G by replac
Publikováno v:
Discrete Applied Mathematics. 236:459-463
We investigate the terminal-pairibility problem in the case when the base graph is a complete bipartite graph, and the demand graph is also bipartite with the same color classes. We improve the lower bound on maximum value of $\Delta(D)$ which still
Publikováno v:
Electronic Notes in Discrete Mathematics. 64:35-44
We investigate a graph theoretical problem arising in the automatic billing of a network toll. Given a network and a family of user paths, we study the graph segmentation problem (GSP) to cover parts of the user paths by a set of disjoint segments. T