المؤلفون: Cencheng Shen

المصدر: Applied Network Science, Vol 9, Iss 1, Pp 1-17 (2024)

مصطلحات موضوعية: Graph embedding, General graph, Asymptotic theory, Applied mathematics. Quantitative methods, T57-57.97

وصف الملف: electronic resource

Relation: https://doaj.org/toc/2364-8228

URL الوصول: https://doaj.org/article/33afcf04b0804afd8f9fa9ed8ee3f50b

المؤلفون: Vazirani, Vijay V.

المساهمون: Vijay V. Vazirani

مصطلحات موضوعية: LP-duality theory, cooperative game theory, core of a game, assignment game, general graph matching game, bipartite b-matching game

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 250, 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.28

الاتاحة: https://doi.org/10.4230/LIPIcs.FSTTCS.2022.28
https://nbn-resolving.org/urn:nbn:de:0030-drops-174207
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.28

المؤلفون: Haixun Sun, Yanyan Zhang, Yijie Zheng, Jianxin Luo, Zhisong Pan

المصدر: Sensors; Volume 22; Issue 21; Pages: 8335

مصطلحات موضوعية: monocular 3D human pose, general graph optimization, multiple constraints, real-time

وصف الملف: application/pdf

Relation: Physical Sensors; https://dx.doi.org/10.3390/s22218335

الاتاحة: https://doi.org/10.3390/s22218335

المؤلفون: Vazirani, Vijay V.

مصطلحات موضوعية: FOS: Computer and information sciences, core of a game, FOS: Economics and business, assignment game, Theory of computation → Algorithmic game theory, Computer Science - Computer Science and Game Theory, LP-duality theory, Computer Science - Data Structures and Algorithms, Economics - Theoretical Economics, Theoretical Economics (econ.TH), general graph matching game, bipartite b-matching game, Data Structures and Algorithms (cs.DS), cooperative game theory, Computer Science and Game Theory (cs.GT)

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::278ba8e946c6ebed8492080ee80dc18c
http://arxiv.org/abs/2202.00619

المؤلفون: Fink, M., Pupyrev, S.

المصدر: Lect. Notes Comput. Sci. ; Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

مصطلحات موضوعية: ALL SOLUTIONS, GENERAL GRAPH, METRO LINES, NUMBER OF BLOCKS, OPTIMAL ALGORITHM, SPECIAL CLASS, TRANSPORTATION LINE, TRANSPORTATION NETWORK, COMPUTER SCIENCE, APPROXIMATION ALGORITHMS

وصف الملف: application/pdf

Relation: Fink M. Ordering metro lines by block crossings / M. Fink, S. Pupyrev. — DOI 10.1007/978-3-642-40313-2_36 // Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). — 2013. — Vol. 8087 LNCS. — P. 397-408.; 3029743; Final; All Open Access, Green; https://www.scopus.com/inward/record.uri?eid=2-s2.0-84885209692&doi=10.1007%2f978-3-642-40313-2_36&partnerID=40&md5=cf70e4be6e9492c1263fc0b304f11d36; https://elar.urfu.ru/bitstream/10995/92447/1/10.7155-jgaa.00351.pdf; http://elar.urfu.ru/handle/10995/102500; 84885209692

الاتاحة: http://elar.urfu.ru/handle/10995/102500
https://www.scopus.com/inward/record.uri?eid=2-s2.0-84885209692&doi=10.1007%2f978-3-642-40313-2_36&partnerID=40&md5=cf70e4be6e9492c1263fc0b304f11d36
https://elar.urfu.ru/bitstream/10995/92447/1/10.7155-jgaa.00351.pdf
https://doi.org/10.1007/978-3-642-40313-2_36

المؤلفون: Glos A., Nahimovs N., Balakirev K., Khadiev K.

المصدر: SCOPUS15700755-2021-20-1-SID85098787024

مصطلحات موضوعية: Exceptional configurations, General graph, Lower bound, Quantum walks, Stationary state, Upper bound

Relation: Quantum Information Processing; 20; http://dspace.kpfu.ru/xmlui/bitstream/net/169452/-1/SCOPUS15700755-2021-20-1-SID85098787024-p1.pdf; https://dspace.kpfu.ru/xmlui/handle/net/169452

الاتاحة: https://dspace.kpfu.ru/xmlui/handle/net/169452

المؤلفون: Takashi Matsuda, Hiroshi Motoda, Takashi Washio

المساهمون: The Pennsylvania State University CiteSeerX Archives

المصدر: http://www.ar.sanken.osaka-u.ac.jp/~motoda/papers/adv_eng_inf02.pdf.

مصطلحات موضوعية: Graph-based induction, General graph structured data, Data mining, Machine learning

وصف الملف: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.297.3914; http://www.ar.sanken.osaka-u.ac.jp/~motoda/papers/adv_eng_inf02.pdf

الاتاحة: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.297.3914
http://www.ar.sanken.osaka-u.ac.jp/~motoda/papers/adv_eng_inf02.pdf

المؤلفون: Ausiello, Giorgio, Franciosa, Paolo G., Lari, Isabella, Ribichini, Andrea

المساهمون: Ausiello, Giorgio, Franciosa, Paolo G., Lari, Isabella, Ribichini, Andrea

مصطلحات موضوعية: fault resiliency, general graph, maximum flow, minimum cut, planar graph, vitality

Relation: info:eu-repo/semantics/altIdentifier/wos/WOS:000470793200005; volume:74; issue:1; firstpage:70; lastpage:78; numberofpages:9; journal:NETWORKS; http://hdl.handle.net/11573/1283352; info:eu-repo/semantics/altIdentifier/scopus/2-s2.0-85061940953

الاتاحة: http://hdl.handle.net/11573/1283352
https://doi.org/10.1002/net.21878

المؤلفون: Hiroshi Motoda, Takashi Matsuda, Takashi Washio, 元田 浩, 松田 喬, 鷲尾 隆

المصدر: 人工知能学会論文誌 / Transactions of the Japanese Society for Artificial Intelligence. 2001, 16(4):363

المؤلفون: Bulteau, L., Fertin, G., Labarre, A., Rusu, I., RIZZI, ROMEO

المساهمون: Dinh T.N., Thai M.T., Bulteau, L., Fertin, G., Labarre, A., Rizzi, Romeo, Rusu, I.

مصطلحات موضوعية: Combinatorial mathematic, Computational complexity, Graph theory, Connected graph, Connected subgraph, Cubic graph, Edge-set, General graph, Graph-theoretic, Input graph, NP Complete, Graphic methods

وصف الملف: STAMPA

Relation: info:eu-repo/semantics/altIdentifier/isbn/9783319426334; info:eu-repo/semantics/altIdentifier/wos/WOS:000389726400032; ispartofbook:Computing and Combinatorics - COCOON 2016; Computing and Combinatorics - 22nd International Conference, COCOON 2016; volume:9797; firstpage:393; lastpage:404; numberofpages:12; alleditors:Dinh T.N., Thai M.T.; http://hdl.handle.net/11562/955000; info:eu-repo/semantics/altIdentifier/scopus/2-s2.0-84979284199; https://www.scopus.com/inward/record.uri?eid=2-s2.0-84979284199&partnerID=40&md5=0738cb08ef55c62df18e27cd6301e87d

الاتاحة: http://hdl.handle.net/11562/955000
https://doi.org/10.1007/978-3-319-42634-1_32
https://www.scopus.com/inward/record.uri?eid=2-s2.0-84979284199&partnerID=40&md5=0738cb08ef55c62df18e27cd6301e87d

المؤلفون: Miroslaw Truszczynski, Zbigniew Lonc

المصدر: Discrete Mathematics. 311(12):966-977

مصطلحات موضوعية: Discrete mathematics, Connectivity, General graph properties, Theoretical Computer Science, Combinatorics, Strong equivalence of graphs, Computational complexity, Vertex-transitive graph, Graph power, FOS: Mathematics, Mathematics - Combinatorics, Discrete Mathematics and Combinatorics, Bound graph, Combinatorics (math.CO), Graph property, Graph factorization, Complement graph, 05C99, Universal graph, Forbidden graph characterization, Mathematics

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c938bdde247bfa0c3778c8495dbb9563

المؤلفون: Irena Rusu, Laurent Bulteau, Anthony Labarre, Guillaume Fertin, Romeo Rizzi

المساهمون: Department of Software Engineering and Theoretical Computer Science (SWT - TUB), Technische Universität Berlin (TU), Laboratoire d'Informatique de Nantes Atlantique (LINA), Centre National de la Recherche Scientifique (CNRS)-Mines Nantes (Mines Nantes)-Université de Nantes (UN), Laboratoire d'Informatique Gaspard-Monge (LIGM), Centre National de la Recherche Scientifique (CNRS)-Fédération de Recherche Bézout-ESIEE Paris-École des Ponts ParisTech (ENPC)-Université Paris-Est Marne-la-Vallée (UPEM), Department of Computer Science [Verona] (UNIVR | DI), University of Verona (UNIVR), Mines Nantes (Mines Nantes)-Université de Nantes (UN)-Centre National de la Recherche Scientifique (CNRS), Université Paris-Est Marne-la-Vallée (UPEM)-École des Ponts ParisTech (ENPC)-ESIEE Paris-Fédération de Recherche Bézout-Centre National de la Recherche Scientifique (CNRS), Università degli studi di Verona = University of Verona (UNIVR), Labarre, Anthony

المصدر: HAL
Proceedings of the 22nd International Computing and Combinatorics Conference (COCOON)
The 22nd International Computing and Combinatorics Conference (COCOON)
The 22nd International Computing and Combinatorics Conference (COCOON), Aug 2016, Ho Chi Minh City, Vietnam
Lecture Notes in Computer Science ISBN: 9783319426334
COCOON

مصطلحات موضوعية: [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], FOS: Computer and information sciences, Computational complexity theory, Combinatorial mathematics, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0102 computer and information sciences, 02 engineering and technology, Input graphs, NP Complete, 01 natural sciences, Combinatorics, Computer Science - Data Structures and Algorithms, [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], 0202 electrical engineering, electronic engineering, information engineering, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Cubic graph, Edge-sets, Mathematics, General graph, Connected graph, 020206 networking & telecommunications, Graph, Traffic grooming, [MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO], Computational complexity, Graph theory, Graph theory, Connected graph, Connected subgraphs, Graph-theoretic, NP Complete, Graphic methods, 010201 computation theory & mathematics, Graphic methods, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], Combinatorics (math.CO), MathematicsofComputing_DISCRETEMATHEMATICS

وصف الملف: application/pdf

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::36736e1a258285e8277ae4509cdbc221

المؤلفون: Zhang, Ning, Shin, Incheol, Li, Bo, Boyaci, Cem, Tiwari, Ravi, Thai, My T.

مصطلحات موضوعية: Approximation algorithm, Distributed algorithm, Dominating tree, General graph, Time complexity, Wireless sensor network

Relation: http://repository.ust.hk/ir/Record/1783.1-79012; Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), v. 5258, 2008, p. 96-108; https://doi.org/10.1007/978-3-540-88582-5-12; http://www.scopus.com/record/display.url?eid=2-s2.0-56749105842&origin=inward; http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=LinksAMR&SrcApp=PARTNER_APP&DestLinkType=FullRecord&DestApp=WOS&KeyUT=000261539200012

الاتاحة: http://repository.ust.hk/ir/Record/1783.1-79012
https://doi.org/10.1007/978-3-540-88582-5-12
http://www.scopus.com/record/display.url?eid=2-s2.0-56749105842&origin=inward
http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=LinksAMR&SrcApp=PARTNER_APP&DestLinkType=FullRecord&DestApp=WOS&KeyUT=000261539200012

المؤلفون: Youn, Jonghee M., Lee, Jongwon, Paek, Yunheung, Lee, Jongeun, Scharwaechter, Hanno, Leupers, Rainer

مصطلحات موضوعية: Application level, Application-Specific, Architecture exploration, ASIP, Code Generation, Code generators, compiler/architecture co-design, Destination location, Embedded processors, Fundamental limitations, General graph, Graph-based, Instruction selection, Instruction set, ISS, Multi-output, Multiple outputs, NP Complete, Optimal codes, Parallel instructions, Programmability, Programmable cores, Tree representation, Tree-based approach

Relation: SOFTWARE-PRACTICE & EXPERIENCE, v.41, no.6, pp.717 - 736; https://scholarworks.unist.ac.kr/handle/201301/3433; http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=79953774556; 1183; 10480; 2-s2.0-79953774556; 000289379600005

الاتاحة: https://scholarworks.unist.ac.kr/handle/201301/3433
http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=79953774556
https://doi.org/10.1002/spe.1034

المؤلفون: N. S. Narayanaswamy, G. Ramakrishna

مصطلحات موضوعية: FOS: Computer and information sciences, Tree-width, Discrete Mathematics (cs.DM), Short cycle, Minimum cycle basis, Characterization (mathematics), Combinatorics, Set (abstract data type), Chordal graph, Outerplanar graph, Partial k-tree, FOS: Mathematics, Discrete Mathematics and Combinatorics, Cycle basis, Mathematics - Combinatorics, 2-Trees, Mathematics, General graph, Discrete mathematics, Applied Mathematics, Treewidth, Graph theory, Graphic methods, Combinatorics (math.CO), Superclass, Computer Science - Discrete Mathematics

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ccd8a525ea5a4b8e8f3455ba1d8fdc82
http://arxiv.org/abs/1302.5889

المؤلفون: Megow, Nicole, Mehlhorn, Kurt, Schweitzer, Pascal

المصدر: Proceedings of the 38th International Colloquium on Automata, Languages and Programming (ICALP 2011) ; http://dl.acm.org/citation.cfm?id=2027272

مصطلحات موضوعية: Keywords: Arbitrary graphs, Competitive algorithms, Competitive analysis, Competitive ratio, Depth first search, General graph, Graph exploration, Local information, Lower bounds, New results, On-line algorithms, Planar graph, Theoretical computer science, Undirect Competitive analysis, Online algorithms

جغرافية الموضوع: Zurich Switzerland

Relation: International Colloquium on Automata, Languages and Programming (ICALP 2011); http://hdl.handle.net/1885/59195; https://openresearch-repository.anu.edu.au/bitstream/1885/59195/5/Schweitzer-online_graph_exploration.pdf.jpg; https://openresearch-repository.anu.edu.au/bitstream/1885/59195/7/01_Megow_Online_Graph_Exploration%3A_New_2011.pdf.jpg

الاتاحة: http://hdl.handle.net/1885/59195
https://doi.org/10.1016/j.tcs.2012.06.034
https://openresearch-repository.anu.edu.au/bitstream/1885/59195/5/Schweitzer-online_graph_exploration.pdf.jpg
https://openresearch-repository.anu.edu.au/bitstream/1885/59195/7/01_Megow_Online_Graph_Exploration%3A_New_2011.pdf.jpg

المؤلفون: Chandran, L.S., Narayanaswamy, N.S.

المصدر: IndraStra Global.

مصطلحات موضوعية: Computation theory, Chordal graphs, Edge connectivity, General graph, Graph G, Min-cut, Minimum degree, Vertex connectivity, Graph theory

URL الوصول: https://explore.openaire.eu/search/publication?articleId=issn23813652::dd060fc82c9c07905af5c9764614cf0d
http://hdl.handle.net/11717/8377

المؤلفون: Groshaus, M., Montero, L.

مصطلحات موضوعية: Bicliques, False-twin-free graphs, Lower bounds, Computational methods, Computer science, Biclique, Free graphs, General graph, Induced subgraphs, Twin-free, Graphic methods

Relation: http://hdl.handle.net/20.500.12110/paper_03043975_v636_n_p77_Groshaus

الاتاحة: https://hdl.handle.net/20.500.12110/paper_03043975_v636_n_p77_Groshaus

المؤلفون: Lin, M.C., Mizrahi, M.J., Szwarcfiter, J.L.

مصطلحات موضوعية: Dominating induced matchings, Exact algorithms, Graph theory, Algorithms, Polynomial approximation, Polynomials, Problem solving, Dominating sets, Edge dominating set, General graph, Induced matchings, Maximal independent set, Polynomial number, Polynomial-time

Relation: http://hdl.handle.net/20.500.12110/paper_01784617_v77_n3_p642_Lin

الاتاحة: https://hdl.handle.net/20.500.12110/paper_01784617_v77_n3_p642_Lin

المؤلفون: Lin, M.C., Mestre, J., Vasiliev, S.

مصطلحات موضوعية: Approximation algorithms, Graph algorithms, Weighted neighborhood independent set, Computational complexity, Problem solving, Approximation ratios, Diamond-free graphs, General graph, Independent set, Maximum degree, Polynomially solvable, Regular graphs, Graph theory

Relation: http://hdl.handle.net/20.500.12110/paper_00200190_v130_n_p11_Lin

الاتاحة: https://hdl.handle.net/20.500.12110/paper_00200190_v130_n_p11_Lin