-
1
المؤلفون: Shibsankar Das, Rahul Kadyan
المساهمون: D, S, Indian Institute of Technology Guwahati (IIT Guwahati), Lab-STICC_UBS_CACS_MOCS, Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance (Lab-STICC), École Nationale d'Ingénieurs de Brest (ENIB)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-Télécom Bretagne-Institut Brestois du Numérique et des Mathématiques (IBNM), Université de Brest (UBO)-Université européenne de Bretagne - European University of Brittany (UEB)-École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS)-École Nationale d'Ingénieurs de Brest (ENIB)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-Télécom Bretagne-Institut Brestois du Numérique et des Mathématiques (IBNM), Université de Brest (UBO)-Université européenne de Bretagne - European University of Brittany (UEB)-École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS)
المصدر: Scientific Annals of Computer Science, Vol XXX, Iss 1, Pp 39-67 (2020)
مصطلحات موضوعية: Factor-critical graph, General Computer Science, Matching (graph theory), [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], Random instances of weighted bipartite graph, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0102 computer and information sciences, 02 engineering and technology, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], 01 natural sciences, Simplex graph, lcsh:QA75.5-76.95, Combinatorics, weighted bipartite matching, [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], 0202 electrical engineering, electronic engineering, information engineering, Blossom algorithm, Mathematics, Hopcroft–Karp algorithm, Discrete mathematics, Applied Mathematics, Graph algorithm, random instances of graphs, experimental evaluation, [MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO], [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Edge-transitive graph, 010201 computation theory & mathematics, Bipartite graph, 020201 artificial intelligence & image processing, Bound graph, combinatorial optimization, lcsh:Electronic computers. Computer science, graph decomposition, Algorithm, MathematicsofComputing_DISCRETEMATHEMATICS
وصف الملف: application/pdf
URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::06075ba68eab8b8b2d9480d485af177f
https://www.info.uaic.ro/en/sacs_articles/a-modied-decomposition-algorithm -for-maximum-weight-bipartite-matching-and-its-experimental-evaluation/ -
2
المؤلفون: Šaško, Mario
المساهمون: Aglić Aljinović, Andrea
مصطلحات موضوعية: sparivanja u bipartitnom grafu, Hungarian method, sparivanja u grafu, TECHNICAL SCIENCES. Computing, matchings in bipartite graphs, Hopcroft-Karp algorithm, TEHNIČKE ZNANOSTI. Računarstvo, Mađarski algoritam, Hopcroft-Karpov algoritam, matchings in graphs
وصف الملف: application/pdf
-
3Dissertation/ Thesis
المؤلفون: Benito Montoro, Raúl, Chen, Xukai
المساهمون: Sierra Rodríguez, José Luis
مصطلحات موضوعية: 004(043.3), Algoritmo Hopcroft-Karp, Equivalencia, Expresiones regulares, Algoritmo deThompson, Algoritmo derivadas, Algoritmo derivadas parciales, Algoritmo Berry-Sethi, Algoritmo seguidores, Autómata finito, Determinación de autómatas, Hopcroft-Karp algorithm, Equivalence, Thompson algorithm, Derivatives algorithm, Partial derivatives algorithm, Berry-Sethi algorithm, Followers algorithm, Finite automata, Automata determination, Informática (Informática), 1203.17 Informática
وصف الملف: application/pdf
Relation: https://github.com/7216nat/TFG_Comprobador-de-equivalencia-entre-especificaciones- basadas-en-expresiones-regulares; https://hdl.handle.net/20.500.14352/10434
الاتاحة: https://hdl.handle.net/20.500.14352/10434
https://github.com/7216nat/TFG_Comprobador-de-equivalencia-entre-especificaciones- basadas-en-expresiones-regulares -
4
المؤلفون: Christoph Brause
المصدر: Discrete Applied Mathematics. 231:113-118
مصطلحات موضوعية: Discrete mathematics, Matching (graph theory), Applied Mathematics, 0211 other engineering and technologies, Trapezoid graph, 021107 urban & regional planning, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Combinatorics, Indifference graph, 010201 computation theory & mathematics, Dominating set, Chordal graph, Independent set, Discrete Mathematics and Combinatorics, Maximal independent set, Algorithm, Mathematics, Hopcroft–Karp algorithm
-
5
المؤلفون: Yixin Yu, Lei Zhao, Shiqian Ma
المصدر: Journal of Modern Power Systems and Clean Energy, Vol 5, Iss 5, Pp 683-695 (2017)
مصطلحات موضوعية: TK1001-1841, Computer science, Random graph generation, Energy Engineering and Power Technology, TJ807-830, Topology, Average degree, 01 natural sciences, Renewable energy sources, 010305 fluids & plasmas, Indifference graph, Production of electric energy or power. Powerplants. Central stations, Power gird topology, 0103 physical sciences, 010306 general physics, Connected component, Random geometric graph, Hopcroft–Karp algorithm, Random graph, Algebraic connectivity, Connectivity, Renewable Energy, Sustainability and the Environment, Random function, Modular decomposition, Dual-stage constructed random graph (DSCRG) algorithm, Algorithm, Graph product
-
6
المؤلفون: Hiorshi Nagamochi, Mingyu Xiao
المصدر: Journal of Combinatorial Optimization. 34:830-873
مصطلحات موضوعية: Discrete mathematics, Graph center, Control and Optimization, Matching (graph theory), Degree (graph theory), Applied Mathematics, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Computer Science Applications, Combinatorics, Computational Theory and Mathematics, 010201 computation theory & mathematics, Independent set, 0202 electrical engineering, electronic engineering, information engineering, Bipartite graph, Discrete Mathematics and Combinatorics, 020201 artificial intelligence & image processing, Feedback vertex set, Maximal independent set, Algorithm, Mathematics, Hopcroft–Karp algorithm
-
7
المؤلفون: Prasun Chakrabarti, Harish Patidar, Amrit Ghosh
المصدر: Indian Journal of Science and Technology. 10:1-9
مصطلحات موضوعية: Matching (graph theory), Computer science, Dinic's algorithm, Parallel algorithm, 02 engineering and technology, Parallel computing, Floyd–Warshall algorithm, Edge cover, Greedy coloring, 030507 speech-language pathology & audiology, 03 medical and health sciences, Ramer–Douglas–Peucker algorithm, Graph power, 0202 electrical engineering, electronic engineering, information engineering, Graph coloring, Time complexity, Sequential algorithm, Blossom algorithm, FSA-Red Algorithm, List coloring, Hopcroft–Karp algorithm, Multidisciplinary, Graph, Vertex (geometry), Edge coloring, Graph bandwidth, Independent set, Reverse-delete algorithm, 020201 artificial intelligence & image processing, Johnson's algorithm, Suurballe's algorithm, Fractional coloring, 0305 other medical science
-
8
المؤلفون: S. N. Popova
المصدر: Siberian Advances in Mathematics. 27:26-75
مصطلحات موضوعية: Discrete mathematics, Random graph, General Mathematics, 010102 general mathematics, 020206 networking & telecommunications, 02 engineering and technology, 01 natural sciences, Metric dimension, Combinatorics, Modular decomposition, Indifference graph, Chordal graph, Law, Bounded quantifier, Random regular graph, 0202 electrical engineering, electronic engineering, information engineering, 0101 mathematics, Mathematics, Hopcroft–Karp algorithm
-
9
المؤلفون: Y.N. Gusenitsa
المصدر: Informatika i sistemy upravleniya. :119-124
مصطلحات موضوعية: Control flow, Theoretical computer science, Search algorithm, Out-of-kilter algorithm, Hopcroft–Karp algorithm, Mathematics
-
10
المؤلفون: Aydn Buluc, Ariful Azad, Alex Pothen
المصدر: Azad, A; Buluc, A; & Pothen, A. (2017). Computing Maximum Cardinality Matchings in Parallel on Bipartite Graphs via Tree-Grafting. IEEE Transactions on Parallel and Distributed Systems, 28(1), 44-59. doi: 10.1109/TPDS.2016.2546258. Lawrence Berkeley National Laboratory: Lawrence Berkeley National Laboratory. Retrieved from: http://www.escholarship.org/uc/item/8kr0b6dd
IEEE Transactions on Parallel and Distributed Systems, vol 28, iss 1مصطلحات موضوعية: Cardinality matching, Matching (graph theory), Computer science, Breadth-first search, Parallel algorithm, 010103 numerical & computational mathematics, 02 engineering and technology, Parallel computing, 01 natural sciences, Computer Software, Cardinality, 3-dimensional matching, 0202 electrical engineering, electronic engineering, information engineering, 0101 mathematics, Blossom algorithm, Hopcroft–Karp algorithm, Communications Technologies, tree grafting, parallel algorithms, Graph, Search tree, Vertex (geometry), Computational Theory and Mathematics, Hardware and Architecture, bipartite graph, Signal Processing, Bipartite graph, 020201 artificial intelligence & image processing, Algorithm design, Distributed Computing, Algorithm
وصف الملف: application/pdf
-
11
المؤلفون: Aydin Buluc, Ariful Azad
المصدر: Azad, A; & Buluç, A. (2016). A matrix-algebraic formulation of distributed-memory maximal cardinality matching algorithms in bipartite graphs. Parallel Computing, 58, 117-130. doi: 10.1016/j.parco.2016.05.007. Lawrence Berkeley National Laboratory: Lawrence Berkeley National Laboratory. Retrieved from: http://www.escholarship.org/uc/item/5d808876
مصطلحات موضوعية: Factor-critical graph, matrix-algebra, Matching (graph theory), Computer Networks and Communications, Computer science, Parallel algorithm, 010103 numerical & computational mathematics, 01 natural sciences, Theoretical Computer Science, Cardinality, parallel algorithm, Artificial Intelligence, 3-dimensional matching, Probabilistic analysis of algorithms, 0101 mathematics, Blossom algorithm, Hopcroft–Karp algorithm, Analysis of parallel algorithms, Randomized algorithms as zero-sum games, cardinality matching, Computer Graphics and Computer-Aided Design, Graph, Vertex (geometry), 010101 applied mathematics, Hardware and Architecture, bipartite graph, Bipartite graph, Cognitive Sciences, Distributed Computing, Algorithm, Software
وصف الملف: application/pdf
-
12
المؤلفون: Yaojie Lu, Sotirios G. Ziavras, Hao Huang
المصدر: International Journal of u- and e- Service, Science and Technology. 9:131-138
مصطلحات موضوعية: Theoretical computer science, Matching (graph theory), Computer Networks and Communications, Computer science, 020209 energy, 02 engineering and technology, Floyd–Warshall algorithm, Cuthill–McKee algorithm, 0202 electrical engineering, electronic engineering, information engineering, Adjacency matrix, Assignment problem, Algorithm, Software, Factor graph, Blossom algorithm, Hopcroft–Karp algorithm
-
13
المؤلفون: Masoud Sagharichian, Morteza Alipour Langouri, Hassan Naderi
المصدر: World Wide Web. 20:399-416
مصطلحات موضوعية: Theoretical computer science, Dense graph, Computer Networks and Communications, Computer science, 02 engineering and technology, Indifference graph, Pathwidth, Chordal graph, 020204 information systems, Partial k-tree, 0202 electrical engineering, electronic engineering, information engineering, Cograph, Pancyclic graph, Hopcroft–Karp algorithm, Block graph, Trapezoid graph, 1-planar graph, Longest path problem, Graph, Vertex (geometry), Metric dimension, Modular decomposition, Treewidth, Hardware and Architecture, Independent set, Odd graph, 020201 artificial intelligence & image processing, Maximal independent set, Software, Graph product, MathematicsofComputing_DISCRETEMATHEMATICS
-
14
المؤلفون: Panos M. Pardalos, Jorge Artieda, Alvaro Lopez, Pablo San Segundo
المصدر: Optimization Letters. 11:343-358
مصطلحات موضوعية: Clique, 021103 operations research, Control and Optimization, Theoretical computer science, Branch and bound, 0211 other engineering and technologies, 02 engineering and technology, Set (abstract data type), Clique problem, Chordal graph, 0202 electrical engineering, electronic engineering, information engineering, Combinatorial optimization, 020201 artificial intelligence & image processing, Algorithm, Sequential algorithm, Mathematics, Hopcroft–Karp algorithm
-
15
المؤلفون: Quanming Li, Huiqiang Wang, Hongwu Lv, Di He, Bingyang Li, Guangsheng Feng
المصدر: Communications in Computer and Information Science ISBN: 9789811517846
CWSNمصطلحات موضوعية: Computer Science::Computer Science and Game Theory, Mathematical optimization, Channel allocation schemes, Computer science, Computer Science::Multimedia, Telecommunications link, Convex optimization, Computer Science::Networking and Internet Architecture, Resource allocation, Throughput, Telecommunications network, Communication channel, Hopcroft–Karp algorithm
-
16
المؤلفون: Ruzayn Quaddoura
المصدر: Open Journal of Discrete Mathematics. :13-24
مصطلحات موضوعية: Discrete mathematics, Mathematics::Combinatorics, Matching (graph theory), 02 engineering and technology, Complete bipartite graph, Combinatorics, Indifference graph, Computer Science::Discrete Mathematics, Chordal graph, 3-dimensional matching, 0202 electrical engineering, electronic engineering, information engineering, Bipartite graph, 020201 artificial intelligence & image processing, Maximal independent set, Mathematics, Hopcroft–Karp algorithm
-
17
المؤلفون: Mingyu Xiao, Hiroshi Nagamochi
المصدر: Discrete Applied Mathematics. 199:137-155
مصطلحات موضوعية: Discrete mathematics, Matching (graph theory), Applied Mathematics, Vertex cover, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Combinatorics, 010201 computation theory & mathematics, Dominating set, Independent set, 0202 electrical engineering, electronic engineering, information engineering, Discrete Mathematics and Combinatorics, 020201 artificial intelligence & image processing, Feedback vertex set, Maximal independent set, Split graph, Hopcroft–Karp algorithm, Mathematics
-
18
المؤلفون: Fredrik Manne, Arif O. Khan, Mahantesh Halappanavar, Pradeep Dubey, Md. Mostofa Ali Patwary, Narayanan Sundaram, Nadathur Satish, Alex Pothen
المصدر: SIAM Journal on Scientific Computing. 38:S593-S619
مصطلحات موضوعية: Vertex (graph theory), Applied Mathematics, Parallel algorithm, Approximation algorithm, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Combinatorics, Minimum k-cut, Computational Mathematics, 010201 computation theory & mathematics, Kruskal's algorithm, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Multiple edges, Greedy algorithm, MathematicsofComputing_DISCRETEMATHEMATICS, Hopcroft–Karp algorithm, Mathematics
-
19
المؤلفون: Song Wang, Lin Qi, Xin Guo, Xiaomin Mu, Yahong Huo
المصدر: IET Computer Vision. 9:960-966
مصطلحات موضوعية: Graph rewriting, Matching (graph theory), business.industry, Point set registration, Graph theory, Pattern recognition, 3-dimensional matching, Outlier, Computer Vision and Pattern Recognition, Artificial intelligence, business, Software, Blossom algorithm, Mathematics, Hopcroft–Karp algorithm
-
20
المؤلفون: Weiru Liu, Ruth F. Hunter, Frank Kee, Zhanyu Ma, Michael Davis, Paul Miller
المصدر: Algorithms, Vol 8, Iss 4, Pp 1143-1174 (2015)
Davis, M C, Ma, Z, Liu, W, Miller, P, Hunter, R & Kee, F 2015, ' Generating Realistic Labelled, Weighted Random Graphs ', Algorithms, vol. 8, no. 4, pp. 1143-1174 . https://doi.org/10.3390/a8041143
Algorithms
Volume 8
Issue 4
Pages 1143-1174مصطلحات موضوعية: lcsh:T55.4-60.8, network models, maximum likelihood estimation, 02 engineering and technology, 01 natural sciences, lcsh:QA75.5-76.95, Theoretical Computer Science, Combinatorics, 010104 statistics & probability, Indifference graph, labelled graphs, Pathwidth, 0202 electrical engineering, electronic engineering, information engineering, lcsh:Industrial engineering. Management engineering, 0101 mathematics, mixture modeling, random graphs, Mathematics, Hopcroft–Karp algorithm, Clustering coefficient, Random graph, generative algorithms, Numerical Analysis, beta distribution, 1-planar graph, Computing and Computers, weighted graphs, Computational Mathematics, Computational Theory and Mathematics, Independent set, 020201 artificial intelligence & image processing, Maximal independent set, lcsh:Electronic computers. Computer science, Jean Golding, MathematicsofComputing_DISCRETEMATHEMATICS, bayesian estimation, variational inference
وصف الملف: application/pdf