Pascal and Francis Bibliographic Databases

Help

Search results

Your search

ct.\*:("Information retrieval. Graph")

Filter

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 7201

  • Page / 289
Export

Selection :

  • and

A genetic algorithm for the maximum edge-disjoint paths problemHSU, Chia-Chun; CHO, Hsun-Jung.Neurocomputing (Amsterdam). 2015, Vol 148, pp 17-22, issn 0925-2312, 6 p.Conference Paper

An efficient construction of one-to-many node-disjoint paths in folded hypercubesLAI, Cheng-Nan.Journal of parallel and distributed computing (Print). 2014, Vol 74, Num 4, pp 2310-2316, issn 0743-7315, 7 p.Article

Avoiding Three Consecutive Blocks of the Same Size and Same SumCASSAIGNE, Julien; CURRIE, James D; SCHAEFFER, Luke et al.Journal of the Association for Computing Machinery. 2014, Vol 61, Num 2, issn 0004-5411, 10.1-10.17Article

All-Pairs Shortest Paths in O(n2) Time with High ProbabilityPERES, Yuval; SOTNIKOV, Dmitry; SUDAKOV, Benny et al.Journal of the Association for Computing Machinery. 2013, Vol 60, Num 4, issn 0004-5411, 26.1-26.25Article

Approximate Shortest Paths Avoiding a Failed Vertex: Near Optimal Data Structures for Undirected Unweighted GraphsBASWANA, Surender; KHANNA, Neelesh.Algorithmica. 2013, Vol 66, Num 1, pp 18-50, issn 0178-4617, 33 p.Article

Complete synchronization of temporal Boolean networksFANGFEI LI; XIWEN LU.Neural networks. 2013, Vol 44, pp 72-77, issn 0893-6080, 6 p.Article

Large-Scale Graph Visualization and Analytics : VISUAL ANALYTICSMA, Kwan-Liu; MUELDER, Chris W.Computer (Long Beach, CA). 2013, Vol 46, Num 7, pp 39-46, issn 0018-9162, 8 p.Article

Ramsey Theory: Learning about the Needle in the HaystackPFLEEGER, Shari Lawrence.IEEE security & privacy. 2013, Vol 11, Num 3, pp 85-87, issn 1540-7993, 3 p.Article

Local versus Global Search in Channel GraphsHUNTER, A. H; PIPPENGER, Nicholas.Networks (New York, NY). 2013, Vol 62, Num 1, pp 27-34, issn 0028-3045, 8 p.Article

The total {k}-domatic number of a graphSHEIKHOLESLAMI, S. M; VOLKMANN, L.Journal of combinatorial optimization. 2012, Vol 23, Num 2, pp 252-260, issn 1382-6905, 9 p.Article

k-tuple total domination in cross products of graphsHENNING, Michael A; KAZEMI, Adel P.Journal of combinatorial optimization. 2012, Vol 24, Num 3, pp 339-346, issn 1382-6905, 8 p.Article

Fast searching games on graphsSTANLEY, Donald; BOTING YANG.Journal of combinatorial optimization. 2011, Vol 22, Num 4, pp 763-777, issn 1382-6905, 15 p.Article

On domination number of Cartesian product of directed pathsJUAN LIU; XINDONG ZHANG; JIXIANG MENG et al.Journal of combinatorial optimization. 2011, Vol 22, Num 4, pp 651-662, issn 1382-6905, 12 p.Article

Which trees have a differentiating-paired dominating set?HENNING, Michael A; MCCOY, John.Journal of combinatorial optimization. 2011, Vol 22, Num 1, pp 1-18, issn 1382-6905, 18 p.Article

Subgraphs of 4-Regular Planar GraphsDOWDEN, Chris; ADDARIO-BERRY, Louigi.Algorithmica. 2011, Vol 61, Num 3, pp 758-776, issn 0178-4617, 19 p.Article

Topological phase transition in a network model with preferential attachment and node removalBAUKE, H; MOORE, C; ROUQUIER, J. B et al.The European physical journal. B, Condensed matter physics (Print). 2011, Vol 83, Num 4, pp 519-524, issn 1434-6028, 6 p.Article

Using spatial indexes for labeled network analysisLAURENT, Thibault; VILLA-VIALANEIX, Nathalie.Information interaction intelligence. 2011, Vol 11, Num 1, pp 9-29, issn 1630-649X, 21 p.Conference Paper

Visualising Multi-Phase Lattice Gas Fluid Layering SimulationsHAWICK, K. A.Modeling, simulation & visualization methods. International conferenceWorldComp'2011. 2011, pp 3-9, isbn 1-60132-192-9, 7 p.Conference Paper

AllDifferent-based filtering for subgraph isomorphismSOLNON, Christine.Artificial intelligence (General ed.). 2010, Vol 174, Num 12-13, pp 850-864, issn 0004-3702, 15 p.Article

Eigensolution of augmented graph products using shifted inverse iteration methodKAVEH, A; FAZLI, H.International journal for numerical methods in engineering. 2010, Vol 83, Num 5, pp 558-574, issn 0029-5981, 17 p.Article

Using matrices to link conflict evolution and resolution in a graph modelHAIYAN XU; KILGOUR, D. Marc; HIPEL, Keith W et al.European journal of operational research. 2010, Vol 207, Num 1, pp 318-329, issn 0377-2217, 12 p.Article

Multiobjective A* Search with Consistent HeuristicsMANDOW, Lawrence; PEREZ DE LA CRUZ, JoSÉ luis.Journal of the Association for Computing Machinery. 2010, Vol 57, Num 5, pp 27-51, issn 0004-5411, 25 p.Article

Housing Markets Through GraphsCECHLAROVA, Katarina; FLEINER, Tamás.Algorithmica. 2010, Vol 58, Num 1, pp 19-33, issn 0178-4617, 15 p.Article

Understanding the Generalized Median Stable MatchingsCHENG, Christine T.Algorithmica. 2010, Vol 58, Num 1, pp 34-51, issn 0178-4617, 18 p.Article

Cheating Strategies for the Gale-Shapley Algorithm with Complete Preference ListsKOBAYASHI, Hirotatsu; MATSUI, Tomomi.Algorithmica. 2010, Vol 58, Num 1, pp 151-169, issn 0178-4617, 19 p.Article

  • Page / 289