|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 1372 occurrences of 740 keywords
|
|
|
Results
Found 2346 publication records. Showing 2346 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
62 | Anand Bhalgat, Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi |
Fast edge splitting and Edmonds' arborescence construction for unweighted graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, pp. 455-464, 2008, SIAM. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
56 | Andrew V. Goldberg, Satish Rao |
Flows in Undirected Unit Capacity Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 38th Annual Symposium on Foundations of Computer Science, FOCS '97, Miami Beach, Florida, USA, October 19-22, 1997, pp. 32-34, 1997, IEEE Computer Society, 0-8186-8197-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
undirected unit capacity networks, undirected networks, graph theory, computation time, maximum flows |
56 | Xianchao Zhang 0001, Weifa Liang, Guoliang Chen 0001 |
Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 14th Annual International Conference, COCOON 2008, Dalian, China, June 27-29, 2008, Proceedings, pp. 577-586, 2008, Springer, 978-3-540-69732-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
52 | Matthew Andrews, Lisa Zhang |
Logarithmic hardness of the undirected edge-disjoint paths problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 53(5), pp. 745-761, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Hardness of approximation, undirected graphs, edge-disjoint paths |
52 | Matthew Andrews, Lisa Zhang |
Hardness of the undirected edge-disjoint paths problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005, pp. 276-283, 2005, ACM, 1-58113-960-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
hardness of approximation, undirected graphs, edge-disjoint paths |
46 | Bao-Xing Chen, Jixiang Meng, Wenjun Xiao |
A Constant Time Optimal Routing Algorithm for Undirected Double-Loop Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MSN ![In: Mobile Ad-hoc and Sensor Networks, First International Conference, MSN 2005, Wuhan, China, December 13-15, 2005, Proceedings, pp. 308-316, 2005, Springer, 3-540-30856-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
undirected double-loop networks, Distributed systems, algorithm, shortest path, optimal routing |
42 | Sushmita Roy, Terran Lane, Margaret Werner-Washburne |
Learning structurally consistent undirected probabilistic graphical models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICML ![In: Proceedings of the 26th Annual International Conference on Machine Learning, ICML 2009, Montreal, Quebec, Canada, June 14-18, 2009, pp. 905-912, 2009, ACM, 978-1-60558-516-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
42 | Omer Reingold |
Undirected connectivity in log-space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 55(4), pp. 17:1-17:24, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
bounded space algorithms, Derandomization, pseudorandom generator |
42 | Andrzej Lingas, Eva-Marta Lundell |
Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008, Proceedings, pp. 736-746, 2008, Springer, 978-3-540-78772-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
42 | Omer Reingold |
Undirected ST-connectivity in log-space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005, pp. 376-385, 2005, ACM, 1-58113-960-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
42 | Guy Kortsarz, Zeev Nutov |
Approximating Node Connectivity Problems via Set Covers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 37(2), pp. 75-92, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Vertex connected spanning subgraph, Metric costs, Approximation algorithms |
39 | Zongpeng Li, Baochun Li, Lap Chi Lau |
On achieving maximum multicast throughput in undirected networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 52(6), pp. 2467-2485, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
undirected networks, multicast, network coding, network flow, duality, Steiner tree, subgradient optimization |
39 | Kamal Jain, Vijay V. Vazirani, Gideon Yuval |
On the capacity of multiple unicast sessions in undirected graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 52(6), pp. 2805-2809, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
entropy calculus, undirected capacity, cryptography, network coding, multicommodity flow, network capacity |
39 | Adam Barclay, Hannes Kaufmann |
An Event-Driven, Stochastic, Undirected Narrative (EDSUN) Framework for Interactive Contents. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TIDSE ![In: Technologies for Interactive Digital Storytelling and Entertainment, Third International Conference, TIDSE 2006, Darmstadt, Germany, December 4-6, 2006., pp. 13-24, 2006, Springer, 3-540-49934-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
stochastic transitions, undirected narrative, augmented reality, framework, grammar, content, event driven, story telling |
39 | Vladimir Trifonov |
An O(log n log log n) space algorithm for undirected st-connectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005, pp. 626-633, 2005, ACM, 1-58113-960-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
space-efficient simulation of parallel algorithms, undirected st-connectivity, space complexity, space-bounded computation |
39 | Matthew Andrews, Lisa Zhang |
Hardness of the undirected congestion minimization problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005, pp. 284-293, 2005, ACM, 1-58113-960-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
hardness of approximation, undirected graphs, congestion minimization |
39 | Roy Armoni, Amnon Ta-Shma, Avi Wigderson, Shiyu Zhou |
An O(log(n)4/3) space algorithm for (s, t) connectivity in undirected graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 47(2), pp. 294-311, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
short pseudorandom walks on graphs, undirected graph connectivity, computational complexity, derandomization, space bounded computations |
39 | Alain Cournier, Michel Habib |
An Efficient Algorithm to Recognize Prime Undirected Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 18th International Workshop, WG '92, Wiesbaden-Naurod, Germany, June 19-20, 1992, Proceedings, pp. 212-224, 1992, Springer, 3-540-56402-0. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
substitution decomposition, autonomous subsets, modules, Undirected graphs, prime graphs |
35 | Zongpeng Li, Baochun Li, Lap Chi Lau |
A Constant Bound on Throughput Improvement of Multicast Network Coding in Undirected Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 55(3), pp. 1016-1026, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
35 | Martin Hofmann 0001, Ulrich Schöpp |
Pointer Programs and Undirected Reachability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, LICS 2009, 11-14 August 2009, Los Angeles, CA, USA, pp. 133-142, 2009, IEEE Computer Society, 978-0-7695-3746-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
35 | Colin Cooper, David Ilcinkas, Ralf Klasing, Adrian Kosowski |
Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (2) ![In: Automata, Languages and Programming, 36th Internatilonal Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part II, pp. 411-422, 2009, Springer, 978-3-642-02929-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
35 | Christian Borgelt |
Learning Undirected Possibilistic Networks with Conditional Independence Tests. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FUZZ-IEEE ![In: FUZZ-IEEE 2007, IEEE International Conference on Fuzzy Systems, Imperial College, London, UK, 23-26 July, 2007, Proceedings, pp. 1-6, 2007, IEEE. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
35 | Yuhua Liu, Kaihua Xu, Hao Huang, Wei Teng |
Research of Undirected Network Capacity Expansion Based on the Spanning-Tree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SEAL ![In: Simulated Evolution and Learning, 6th International Conference, SEAL 2006, Hefei, China, October 15-18, 2006, Proceedings, pp. 228-235, 2006, Springer, 3-540-47331-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
35 | Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Frank Thomson Leighton, Harald Räcke |
New lower bounds for oblivious routing in undirected graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006, pp. 918-927, 2006, ACM Press, 0-89871-605-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
35 | Rezaul Alam Chowdhury, Vijaya Ramachandran |
External-memory exact and approximate all-pairs shortest-paths in undirected graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005, pp. 735-744, 2005, SIAM, 0-89871-585-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
35 | Einoshin Suzuki |
Undirected Exception Rule Discovery as Local Pattern Detection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Local Pattern Detection ![In: Local Pattern Detection, International Seminar, Dagstuhl Castle, Germany, April 12-16, 2004, Revised Selected Papers, pp. 207-216, 2004, Springer, 3-540-26543-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
35 | Dorit Dor, Shay Halperin, Uri Zwick |
All Pairs Almost Shortest Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 37th Annual Symposium on Foundations of Computer Science, FOCS '96, Burlington, Vermont, USA, 14-16 October, 1996, pp. 452-461, 1996, IEEE Computer Society, 0-8186-7594-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
all pairs almost shortest paths, unweighted undirected graph, matrix multiplication algorithm, 3-spanner, weighted undirected graph, matrix multiplication, vertices, Boolean matrix multiplication |
35 | Justin Domke, Alap Karapurkar, Yiannis Aloimonos |
Who killed the directed model? ![Search on Bibsonomy](Pics/bibsonomy.png) |
CVPR ![In: 2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2008), 24-26 June 2008, Anchorage, Alaska, USA, 2008, IEEE Computer Society, 978-1-4244-2242-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
35 | László Babai |
On the diameter of Eulerian orientations of graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006, pp. 822-831, 2006, ACM Press, 0-89871-605-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
35 | Guy Even, Guy Kortsarz, Wolfgang Slany |
On network design problems: fixed cost flows and the covering steiner problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 1(1), pp. 74-101, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Optimization, approximation, graphs, theory, flow |
35 | Georg Gottlob, Phokion G. Kolaitis, Thomas Schwentick |
Existential second-order logic over graphs: Charting the tractability frontier. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 51(2), pp. 312-362, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Existential second-order logic, graph constraints, prefix classes, graph coloring, NP-complete problems, finite model theory |
32 | Hua Liu, Huilai Zou, Lili Zhong, Chaonan Wang, Youtian Qu |
Improvement of the Optimal Hamilton Circuit for Undirected Complete Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIT ![In: 10th IEEE International Conference on Computer and Information Technology, CIT 2010, Bradford, West Yorkshire, UK, June 29-July 1, 2010, pp. 2129-2133, 2010, IEEE Computer Society, 978-0-7695-4108-2. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
undirected complete graph, Optimal Hamilton Circuit, Gradually Convergent Algorithm, Cross-wire Cutting Algorithm, Nearest Neighbor Algorithm |
32 | Hiroshi Nagamochi, S. Nakamura, Toshihide Ibaraki |
A Simplified Õ(nm) Time Edge-Splitting Algorithm in Undirected Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 26(1), pp. 50-67, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Edge splitting, Deterministic algorithm, Undirected graph, Polynomial algorithm, Minimum cut, Edge-connectivity, Multigraph |
32 | H. E. Escuardro, Felix P. Muga II |
Wide-diameter of generalized undirected de Bruijn graph UGB(n, n2). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: 1997 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '97), 18-20 December 1997, Taipei, Taiwan, pp. 417-420, 1997, IEEE Computer Society, 0-8186-8259-0. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
undirected, graph theory, digraph, de Bruijn graph, wide-diameter |
32 | Noam Nisan, Endre Szemerédi, Avi Wigderson |
Undirected Connectivity in O(log ^1.5 n) Space ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, Pennsylvania, USA, 24-27 October 1992, pp. 24-29, 1992, IEEE Computer Society, 0-8186-2900-2. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
recursive doubling technique, connectivity problem, deterministic algorithm, undirected graphs, space complexity |
32 | Paul Beame, Allan Borodin, Prabhakar Raghavan, Walter L. Ruzzo, Martin Tompa |
Time-Space Tradeoffs for Undirected Graph Traversal ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 31st Annual Symposium on Foundations of Computer Science, St. Louis, Missouri, USA, October 22-24, 1990, Volume I, pp. 429-438, 1990, IEEE Computer Society, 0-8186-2082-X. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
jumping automata, undirected graph traversal, quadratic lower bound, probabilistic upper bound, time-space tradeoff, deterministic model |
32 | Miklós Ajtai, Ronald Fagin |
Reachability Is Harder for Directed than for Undirected Finite Graphs (Preliminary Version) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 29th Annual Symposium on Foundations of Computer Science, White Plains, New York, USA, 24-26 October 1988, pp. 358-367, 1988, IEEE Computer Society, 0-8186-0877-3. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
efficiency of algorithms, undirected finite graphs, Ehrenfeucht-Fraisse games, directed graphs, reachability |
31 | Quanjun Wu, Lan Xiang 0001, Jin Zhou |
Average Consensus in Delayed Networks of Dynamic Agents with Impulsive Effects. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Complex (1) ![In: Complex Sciences, First International Conference, Complex 2009, Shanghai, China, February 23-25, 2009. Revised Papers, Part 1, pp. 1124-1138, 2009, Springer, 978-3-642-02465-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
average consensus, undirected network, impulsive effects, multi-agent systems, time-delays |
31 | Hiroshi Hosobe |
A high-dimensional approach to interactive graph visualization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAC ![In: Proceedings of the 2004 ACM Symposium on Applied Computing (SAC), Nicosia, Cyprus, March 14-17, 2004, pp. 1253-1257, 2004, ACM, 1-58113-812-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
general undirected graphs, interactive graph layout, information visualization, multidimensional scaling |
31 | Yoko Kamidoi, Shin'ichi Wakabayashi, Noriyoshi Yoshida |
A Divide-and-Conquer Approach to the Minimum k-Way Cut Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 32(2), pp. 262-276, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Minimum k -way cut, Maximum flow computation, Undirected weighted graph, Deterministic algorithm, Recursive structure |
31 | Hans L. Bodlaender, Babette van Antwerpen-de Fluiter |
Parallel Algorithms for Series Parallel Graphs and Graphs with Treewidth Two. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 29(4), pp. 534-559, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Minimum k -way cut, Maximum flow computation, Undirected weighted graph, Deterministic algorithm, Recursive structure |
31 | Tzong-Wann Kao, Shi-Jinn Horng |
Computing Dominators and Its Applications on Processor Arrays with Reconfigurable Bus Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: 1996 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '96), June 12-14, 1996, Beijing, China, pp. 302-308, 1996, IEEE Computer Society, 0-8186-7460-1. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
bridge-connected components, reconfigurable bus system, dominator, undirected graphs, bridge, dominator tree, biconnected components, articulation point |
31 | Biing-Feng Wang, Gen-Huey Chen |
Constant Time Algorithms for the Transitive Closure and Some Related Graph Problems on Processor Arrays with Reconfigurable Bus Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 1(4), pp. 500-507, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
related graph problems, reconfigurable bus systems, parallel algorithms, graph theory, minimum spanning trees, bipartite graphs, transitive closure, transitive closure, connected components, processor arrays, undirected graph, bridges, biconnected components, graph problems, articulation points |
31 | Shinji Umeyama |
An Eigendecomposition Approach to Weighted Graph Matching Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 10(5), pp. 695-703, 1988. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
weighted graph matching, undirected-graph-matching, Hermitian matrices, directed-graph-matching, pattern recognition, pattern recognition, graph theory, eigenvalues and eigenfunctions, eigendecomposition, adjacency matrices |
29 | James D. Currie, Lucas Mol |
The undirected repetition threshold and undirected pattern avoidance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 866, pp. 56-69, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
29 | James D. Currie, Lucas Mol |
The undirected repetition threshold and undirected pattern avoidance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2006.07474, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
28 | Darin Goldstein, Kojiro Kobayashi |
On the Complexity of the "Most General" Undirected Firing Squad Synchronization Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007, Proceedings, pp. 244-255, 2007, Springer, 978-3-540-77118-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
28 | Christophe Gonzales, Khaled Mellouli, Olfa Mourali |
On Directed and Undirected Propagation Algorithms for Bayesian Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECSQARU ![In: Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 9th European Conference, ECSQARU 2007, Hammamet, Tunisia, October 31 - November 2, 2007, Proceedings, pp. 598-610, 2007, Springer, 978-3-540-75255-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
28 | Walid Belkhir, Luigi Santocanale |
Undirected Graphs of Entanglement 2. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 27th International Conference, New Delhi, India, December 12-14, 2007, Proceedings, pp. 508-519, 2007, Springer, 978-3-540-77049-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
28 | Nicolas Beldiceanu, Irit Katriel, Xavier Lorca |
Undirected Forest Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPAIOR ![In: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Third International Conference, CPAIOR 2006, Cork, Ireland, May 31 - June 2, 2006, Proceedings, pp. 29-43, 2006, Springer, 3-540-34306-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
28 | Qingguo Zhang, Huayong Liu, Wei Zhang, Yajun Guo |
Drawing Undirected Graphs with Genetic Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICNC (3) ![In: Advances in Natural Computation, First International Conference, ICNC 2005, Changsha, China, August 27-29, 2005, Proceedings, Part III, pp. 28-36, 2005, Springer, 3-540-28320-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
28 | Peter Mahlmann, Christian Schindelhauer |
Peer-to-peer networks based on random transformations of connected regular undirected graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, July 18-20, 2005, Las Vegas, Nevada, USA, pp. 155-164, 2005, ACM, 1-58113-986-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
distributed algorithms, peer-to-peer networks, random graphs, expander graphs |
28 | Liam Roditty, Uri Zwick |
Dynamic Approximate All-Pairs Shortest Paths in Undirected Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 45th Symposium on Foundations of Computer Science (FOCS 2004), 17-19 October 2004, Rome, Italy, Proceedings, pp. 499-508, 2004, IEEE Computer Society, 0-7695-2228-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
28 | Venkatesh Raman 0001, Saket Saurabh 0001, C. R. Subramanian 0001 |
Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings, pp. 241-248, 2002, Springer, 3-540-00142-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
28 | Ulrich Meyer 0001 |
External memory BFS on undirected graphs with bounded degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, USA., pp. 87-88, 2001, ACM/SIAM, 0-89871-490-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP BibTeX RDF |
|
28 | Mikkel Thorup |
Undirected Single-Source Shortest Paths with Positive Integer Weights in Linear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 46(3), pp. 362-394, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
RAM algorithms, shortest paths |
28 | John Watrous |
Quantum Simulations of Classical Random Walks and Undirected Graph Connectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 14th Annual IEEE Conference on Computational Complexity, Atlanta, Georgia, USA, May 4-6, 1999, pp. 180-187, 1999, IEEE Computer Society, 0-7695-0075-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
quantum computation, graph connectivity, space-bounded computation |
28 | John H. Reif |
Minimum S-T Cut of a Planar Undirected Network in O(n log²(n)) Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 8th Colloquium, Acre (Akko), Israel, July 13-17, 1981, Proceedings, pp. 56-67, 1981, Springer, 3-540-10843-2. The full citation details ...](Pics/full.jpeg) |
1981 |
DBLP DOI BibTeX RDF |
|
28 | Zeev Nutov |
An almost O(log k)-approximation for k-connected subgraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009, pp. 912-921, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
28 | Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Harald Räcke, Tom Leighton |
Oblivious routing on node-capacitated and directed graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 3(4), pp. 51, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
node-capacitated graphs, directed graphs, communication networks, Oblivious routing |
28 | Micah Adler, Nicholas J. A. Harvey, Kamal Jain, Robert D. Kleinberg, April Rasala Lehman |
On the capacity of information networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006, pp. 241-250, 2006, ACM Press, 0-89871-605-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
28 | Tamás Király, Lap Chi Lau |
Approximate Min-Max Theorems of Steiner Rooted-Orientations of Hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 21-24 October 2006, Berkeley, California, USA, Proceedings, pp. 283-292, 2006, IEEE Computer Society, 0-7695-2720-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
28 | Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton, Harald Räcke |
Oblivious routing on node-capacitated and directed graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005, pp. 782-790, 2005, SIAM, 0-89871-585-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
28 | Guy Kortsarz, Zeev Nutov |
Approximation algorithm for k-node connected subgraphs via critical graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004, pp. 138-145, 2004, ACM, 1-58113-852-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
28 | Edith Hemaspaandra, Holger Spakowski, Mayur Thakur |
Complexity of Cycle Length Modularity Problems in Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2004: Theoretical Informatics, 6th Latin American Symposium, Buenos Aires, Argentina, April 5-8, 2004, Proceedings, pp. 509-518, 2004, Springer, 3-540-21258-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
28 | Andreas Jakoby, Maciej Liskiewicz |
Paths Problems in Symmetric Logarithmic Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002, Proceedings, pp. 269-280, 2002, Springer, 3-540-43864-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
28 | Guy Even, Guy Kortsarz, Wolfgang Slany |
On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT 2002, 8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002 Proceedings, pp. 318-327, 2002, Springer, 3-540-43866-1. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
28 | Stavros G. Kolliopoulos, Clifford Stein 0001 |
Improved Approximation Algorithms for Unsplittable Flow Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 38th Annual Symposium on Foundations of Computer Science, FOCS '97, Miami Beach, Florida, USA, October 19-22, 1997, pp. 426-435, 1997, IEEE Computer Society, 0-8186-8197-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
24 | Carlile Lavor, Leo Liberti, Antonio Mucherino, Nelson Maculan |
On a discretizable subclass of instances of the molecular distance geometry problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAC ![In: Proceedings of the 2009 ACM Symposium on Applied Computing (SAC), Honolulu, Hawaii, USA, March 9-12, 2009, pp. 804-805, 2009, ACM, 978-1-60558-166-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
protein backbone, protein molecules, undirected weighted graph, distance geometry, combinatorialization |
24 | Maytham Safar, Hisham Farahat, Khaled Mahdi |
Analysis of dynamic social network: e-mail messages exchange network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
iiWAS ![In: iiWAS'2009 - The Eleventh International Conference on Information Integration and Web-based Applications and Services, 14-16 December 2009, Kuala Lumpur, Malaysia, pp. 41-48, 2009, ACM, 978-1-60558-660-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
cyclic entropy, email analysis, undirected, graphs, cycles, directed |
24 | Ajith Abraham, Hongbo Liu 0001, Youakim Badr, Crina Grosan |
A multi-swarm approach for neighbor selection in peer-to-peer networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSTST ![In: CSTST 2008: Proceedings of the 5th International Conference on Soft Computing as Transdisciplinary Science and Technology, Cergy-Pontoise, France, October 28-31, 2008, pp. 178-184, 2008, ACM, 978-1-60558-046-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
P2P swarming networks, genetic algorithm, undirected graph, particle swarm, neighbor selection |
24 | Xuerui Wang, Chris Pal, Andrew McCallum |
Generalized component analysis for text with heterogeneous attributes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KDD ![In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Jose, California, USA, August 12-15, 2007, pp. 794-803, 2007, ACM, 978-1-59593-609-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
author prediction, multimodal heterogeneous data, recipient prediction, undirected graphical models, text mining, topic modeling |
24 | Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki |
Augmenting a (k-1)-Vertex-Connected Multigraph l-Edge-Connected and k-Vertex-Connected Multigraph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 44(3), pp. 257-280, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Undirected multigraph, Graph augmentation, Deterministic algorithm, Edge-connectivity, Vertex-connectivity, Polynomial time approximation algorithm |
24 | Eric Louie, Tsau Young Lin |
Semantics and Syntactic Patterns in Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Rough Sets and Current Trends in Computing ![In: Rough Sets and Current Trends in Computing, 4th International Conference, RSCTC 2004, Uppsala, Sweden, June 1-5, 2004, Proceedings, pp. 285-294, 2004, Springer, 3-540-22117-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
interesting-ness, undirected association rules, Data mining, semantics, isomorphism |
24 | Christian Capelle, Michel Habib |
Graph decompositions and factorizing permutations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISTCS ![In: Fifth Israel Symposium on Theory of Computing and Systems, ISTCS 1997, Ramat-Gan, Israel, June 17-19, 1997, Proceedings, pp. 132-143, 1997, IEEE Computer Society, 0-8186-8037-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
factorizing permutations, decomposition sets, inheritance graph decomposition, optimization, graph theory, vertices, undirected graph, chordal graphs, graph decompositions, decomposition algorithms, linear algorithm, modular decomposition, decomposition tree |
24 | Paolo Ferragina |
An EREW PRAM fully-dynamic algorithm for MST. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPPS ![In: Proceedings of IPPS '95, The 9th International Parallel Processing Symposium, April 25-28, 1995, Santa Barbara, California, USA, pp. 93-100, 1995, IEEE Computer Society, 0-8186-7074-6. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
EREW PRAM fully-dynamic algorithm, undirected weighted graph, single edge insertions, single edge deletions, sparsification data structure, parallel algorithms, parallel algorithm, computational complexity, time, trees (mathematics), minimum spanning tree, tree data structures, nodes, work |
24 | Steven Homer, Marcus Peinado |
A highly parallel algorithm to approximate MaxCut on distributed memory architectures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPPS ![In: Proceedings of IPPS '95, The 9th International Parallel Processing Symposium, April 25-28, 1995, Santa Barbara, California, USA, pp. 113-117, 1995, IEEE Computer Society, 0-8186-7074-6. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
MaxCut, maximum weight cut, weighted undirected graph, linear speedup, parallel algorithms, parallel algorithm, graph theory, distributed memory systems, distributed memory architectures, Connection Machine |
24 | Jia-Shung Wang, Biing-Feng Wang, Chen-Hsing Peng |
Recognizing depth-first-search trees in parallel. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPPS ![In: Proceedings of IPPS '95, The 9th International Parallel Processing Symposium, April 25-28, 1995, Santa Barbara, California, USA, pp. 101-105, 1995, IEEE Computer Society, 0-8186-7074-6. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
depth-first-search trees, parallel algorithms, parallel algorithm, computational complexity, directed graphs, time complexity, spanning tree, search problems, undirected graph, tree searching, speed-up, EREW PRAM model |
24 | Ernst W. Mayr |
Scheduling interval orders in parallel. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HICSS (2) ![In: 28th Annual Hawaii International Conference on System Sciences (HICSS-28), January 3-6, 1995, Kihei, Maui, Hawaii, USA, pp. 20-28, 1995, IEEE Computer Society, 0-8186-6945-4. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
interval order scheduling, interval representations, transitively oriented digraph, undirected chordal complement, identical parallel processors, minimal length schedule, scheduling distance computation subroutine, incremental version, empty slots, interval order precedence constraints, scheduling, parallel algorithms, parallel algorithm, computational complexity, concurrency control, directed graphs, partial orders, NP-complete problems, deadlines, execution time, minimisation, interval graphs, optimal schedule, release times, NC-algorithm, CREW-PRAM, task systems |
24 | Jin-Tai Yan, Pei-Yung Hsiao |
A new fuzzy-clustering-based approach for two-way circuit partitioning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VLSI Design ![In: 8th International Conference on VLSI Design (VLSI Design 1995), 4-7 January 1995, New Delhi, India, pp. 359-364, 1995, IEEE Computer Society, 0-8186-6905-5. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
fuzzy-clustering-based approach, two-way circuit partitioning, circuit netlist, undirected edge-weighted graph, tree net model, clustering distance, area information, area-balanced constraints, circuit benchmarks, VLSI, simulated annealing, network topology, trees (mathematics), fuzzy set theory, logic partitioning, fuzzy c-means clustering, fuzzy memberships |
24 | Zhenyu Wu, Richard M. Leahy |
An Optimal Graph Theoretic Approach to Data Clustering: Theory and Its Application to Image Segmentation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 15(11), pp. 1101-1113, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
optimal graph theoretic approach, undirected adjacency graph, arc capacities, mutually exclusive subgraphs, largest inter-subgraph maximum flow minimization, flow and cut equivalent tree partitioning, subgraph condensation, partially equivalent tree, region boundary location, closed edge contours, pattern recognition, image segmentation, image segmentation, graph theory, data clustering, minimax techniques |
24 | Joseph E. Grimes |
Scheduling to reduce conflict in meetings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Commun. ACM ![In: Commun. ACM 13(6), pp. 351-352, 1970. The full citation details ...](Pics/full.jpeg) |
1970 |
DBLP DOI BibTeX RDF |
conflict matrix, undirected linear graph, scheduling, spanning tree, allocation, connected component |
21 | John Thomas, Naren Ramakrishnan, Chris Bailey-Kellogg |
Protein Design by Sampling an Undirected Graphical Model of Residue Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE ACM Trans. Comput. Biol. Bioinform. ![In: IEEE ACM Trans. Comput. Biol. Bioinform. 6(3), pp. 506-516, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
residue coupling, Markov chain Monte Carlo (MCMC), graphical models, Protein design |
21 | María Luisa Pérez-Delgado |
Rank-Based Ant System to Solve the Undirected Rural Postman Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWANN (2) ![In: Distributed Computing, Artificial Intelligence, Bioinformatics, Soft Computing, and Ambient Assisted Living, 10th International Work-Conference on Artificial Neural Networks, IWANN 2009 Workshops, Salamanca, Spain, June 10-12, 2009. Proceedings, Part II, pp. 507-514, 2009, Springer, 978-3-642-02480-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Rural Postman Problem, Traveling Salesman Problem, Artificial ants |
21 | Ian Walsh, Alessandro Vullo, Gianluca Pollastri |
Recursive Neural Networks for Undirected Graphs for Learning Molecular Endpoints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PRIB ![In: Pattern Recognition in Bioinformatics, 4th IAPR International Conference, PRIB 2009, Sheffield, UK, September 7-9, 2009. Proceedings, pp. 391-403, 2009, Springer, 978-3-642-04030-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
21 | Xiaofeng Gu, Kamesh Madduri, K. Subramani 0001, Hong-Jian Lai |
Improved Algorithms for Detecting Negative Cost Cycles in Undirected Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FAW ![In: Frontiers in Algorithmics, Third International Workshop, FAW 2009, Hefei, China, June 20-23, 2009. Proceedings, pp. 40-50, 2009, Springer, 978-3-642-02269-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
21 | Ulrich Schöpp |
A Formalised Lower Bound on Undirected Graph Reachability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: Logic for Programming, Artificial Intelligence, and Reasoning, 15th International Conference, LPAR 2008, Doha, Qatar, November 22-27, 2008. Proceedings, pp. 621-635, 2008, Springer, 978-3-540-89438-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
21 | SeungJin Lim |
An Interactive, 3D Visual Exploration Tool for Undirected Relationships. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISM ![In: Tenth IEEE International Symposium on Multimedia (ISM2008), December 15-17, 2008, Berkeley, California, USA, pp. 460-467, 2008, IEEE Computer Society, 978-0-7695-3454-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
21 | Frank K. H. A. Dehne, Michael R. Fellows, Michael A. Langston, Frances A. Rosamond, Kim Stevens |
An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 41(3), pp. 479-492, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
21 | Toshimasa Ishii |
Greedy Approximation for Source Location Problem with Vertex-Connectivity Requirements in Undirected Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007, Proceedings, pp. 29-40, 2007, Springer, 978-3-540-77118-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
21 | Luca Allulli, Peter Lichodzijewski, Norbert Zeh |
A faster cache-oblivious shortest-path algorithm for undirected graphs with bounded edge lengths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007, pp. 910-919, 2007, SIAM, 978-0-898716-24-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
21 | Yan Liu 0002, Jun Yang 0003, Alexander G. Hauptmann |
Undirected Graphical Models for Video Analysis and Classification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICME ![In: Proceedings of the 2007 IEEE International Conference on Multimedia and Expo, ICME 2007, July 2-5, 2007, Beijing, China, pp. 1495-1498, 2007, IEEE Computer Society, 1-4244-1017-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
21 | S. M. Sadegh Tabatabaei Yazdi, Serap A. Savari, Kelli Carlson, Gerhard Kramer |
The Capacity Region of a Collection of Multicast Sessions in an Undirected Ring Network. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPP Workshops ![In: 2007 International Conference on Parallel Processing Workshops (ICPP Workshops 2007), 10-14 September 2007, Xi-An, China, pp. 40, 2007, IEEE Computer Society, 978-0-7695-2934-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
21 | Chunguang Ma, Peng Wu, Lingling Wang, Guoyin Zhang |
A Novel Method to Authenticate Transitively Closed Undirected Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IMSCCS ![In: Proceeding of the Second International Multi-Symposium of Computer and Computational Sciences (IMSCCS 2007), August 13-15, 2007, The University of Iowa, Iowa City, Iowa, USA, pp. 537-542, 2007, IEEE Computer Society, 0-7695-3039-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
transitively closed graph, one-way accumulators, authentication, signatures |
21 | Gerhard Reinelt, Dirk Oliver Theis |
A note on the Undirected Rural Postman Problem polytope. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 106(3), pp. 447-452, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 90C57, 05c45 |
21 | Timothy M. Chan |
All-pairs shortest paths for unweighted undirected graphs in o(mn) time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006, pp. 514-523, 2006, ACM Press, 0-89871-605-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Ulrich Meyer 0001, Norbert Zeh |
I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2006, 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings, pp. 540-551, 2006, Springer, 3-540-38875-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Amos Fiat, Haim Kaplan, Meital Levy, Svetlana Olonetsky, Ronen Shabo |
On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part I, pp. 608-618, 2006, Springer, 3-540-35904-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Kevin Burrage, Vladimir Estivill-Castro, Michael R. Fellows, Michael A. Langston, Shev Mac, Frances A. Rosamond |
The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWPEC ![In: Parameterized and Exact Computation, Second International Workshop, IWPEC 2006, Zürich, Switzerland, September 13-15, 2006, Proceedings, pp. 192-202, 2006, Springer, 3-540-39098-7. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
21 | Dariusz R. Kowalski, Andrzej Pelc |
Broadcasting in undirected ad hoc radio networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Distributed Comput. ![In: Distributed Comput. 18(1), pp. 43-57, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Broadcasting, Distributed, Randomized, Radio network, Deterministic |
Displaying result #1 - #100 of 2346 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|