Search Results - "Discrete Mathematics—Graph algorithms"
-
1
Authors:
Source: Ninth International Conference on Intelligent Systems Design and Applications, Pisa, Italy, 2009
info:cnr-pdr/source/autori:Geraci F.; Pellegrini M.; Renda M. E./congresso_nome:Ninth International Conference on Intelligent Systems Design and Applications/congresso_luogo:Pisa, Italy/congresso_data:2009/anno:2009/pagina_da:/pagina_a:/intervallo_pagineSubject Terms: (l-d) Challenge Problem, graph-based algorithm, G.2 DISCRETE MATHEMATICS. Graph algorithms, TFBS detection, motif finding problem
Access URL: https://publications.cnr.it/doc/83677
http://www.cnr.it/prodotto/i/83677
http://wwwold.iit.cnr.it/staff/marco.pellegrini/papiri/motif-ISDA.pdf
https://dblp.uni-trier.de/db/conf/isda/isda2009.html#GeraciPR09
https://ieeexplore.ieee.org/document/5364851/
http://dblp.uni-trier.de/db/conf/isda/isda2009.html#GeraciPR09
http://ieeexplore.ieee.org/document/5364851/
http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000005364851
https://hdl.handle.net/20.500.14243/75927 -
2
Authors: et al.
Contributors: et al.
Subject Terms: ing, Discrete Mathematics—Graph Algorithms
File Description: application/pdf
-
3
Authors: et al.
Contributors: et al.
Subject Terms: Categories and Subject Descriptors, F.2.2 [Analysis Of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Computations on discrete structures, G.2.2 [Mathematics of Computing, Discrete Mathematics—Graph algorithms, Network problems General Terms, Algorithms, Theory Additional Key Words and Phrases, exact exponential algorithms, listing algorithms, measure and conquer, minimum dominating set, minimum set cover, domatic number
File Description: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.144.328; http://www.ii.uib.no/~fomin/fedor/articles1/domnum.pdf
-
4
Authors:
Contributors:
Subject Terms: Categories and Subject Descriptors C.2.1 [Computer-Communication Networks, Network Architecture and Design—Wireless Communication, G.2.2 [Mathematics of Computing, Discrete Mathematics— Graph algorithms, Network problems
File Description: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.68.3029; http://www.jasonredi.com/papers/pdf/BasuRedi_SensorOverhearing_IPSN04.pdf
-
5
Authors:
Contributors:
Subject Terms: Categories and Subject Descriptors C.2.1 [Computer-Communication Networks, Network Architecture and Design|Wireless communication, Network topology, G.2.2 [Mathematics of Computing, Discrete Mathematics|Graph algorithms, Network problems
File Description: application/pdf
-
6
Authors: et al.
Contributors: et al.
Subject Terms: Geometrical problems and computations, G.2.2 [Mathematics of Computing, Discrete mathematics—Graph algorithms General Terms, Approximation, heuristics, geometric optimization Additional Key Words and Phrases, geometric problems, Fermat-Weber problem, maximum Traveling Salesman Problem (MTSP, maximum weighted matching, near-linear algorithms
File Description: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.341.8347; http://arxiv.org/pdf/cs/0212044v1.pdf
-
7
Authors:
Contributors:
Subject Terms: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Computations on discrete structures, G.2.2 [Mathematics of Computing, Discrete Mathematics—Graph Algorithms General Terms, Algorithms, Theory Additional Key Words and Phrases, Bounded length, dynamic environment, oracle, planar graph, shortest
File Description: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.104.7574; http://www.mimuw.edu.pl/~kowalik/papers/oracle.pdf
Nájsť tento článok vo Web of Science