Search results for "undirected graphs"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
3	Alain Cournier, Michel Habib	An Efficient Algorithm to Recognize Prime Undirected Graphs.	WG	1992	DBLP DOI BibTeX RDF	substitution decomposition, autonomous subsets, modules, Undirected graphs, prime graphs
2	Ian Walsh, Alessandro Vullo, Gianluca Pollastri	Recursive Neural Networks for Undirected Graphs for Learning Molecular Endpoints.	PRIB	2009	DBLP DOI BibTeX RDF
2	Luca Allulli, Peter Lichodzijewski, Norbert Zeh	A faster cache-oblivious shortest-path algorithm for undirected graphs with bounded edge lengths.	SODA	2007	DBLP DOI BibTeX RDF
2	Walid Belkhir, Luigi Santocanale	Undirected Graphs of Entanglement 2.	FSTTCS	2007	DBLP DOI BibTeX RDF
2	Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Frank Thomson Leighton, Harald Räcke	New lower bounds for oblivious routing in undirected graphs.	SODA	2006	DBLP DOI BibTeX RDF
2	Rezaul Alam Chowdhury, Vijaya Ramachandran	External-memory exact and approximate all-pairs shortest-paths in undirected graphs.	SODA	2005	DBLP DOI BibTeX RDF
2	Qing-Guo Zhang, Huayong Liu, Wei Zhang, Ya-Jun Guo	Drawing Undirected Graphs with Genetic Algorithms.	ICNC	2005	DBLP DOI BibTeX RDF
2	Peter Mahlmann, Christian Schindelhauer	Peer-to-peer networks based on random transformations of connected regular undirected graphs.	SPAA	2005	DBLP DOI BibTeX RDF	distributed algorithms, peer-to-peer networks, random graphs, expander graphs
2	Yong Zhang, Hong Zhu	An Approximation Algorithm for Weighted Weak Vertex Cover Problem in Undirected Graphs.	COCOON	2004	DBLP DOI BibTeX RDF
2	Liam Roditty, Uri Zwick	Dynamic Approximate All-Pairs Shortest Paths in Undirected Graphs.	FOCS	2004	DBLP DOI BibTeX RDF
2	Hiroshi Hosobe	A high-dimensional approach to interactive graph visualization.	SAC	2004	DBLP DOI BibTeX RDF	general undirected graphs, interactive graph layout, information visualization, multidimensional scaling
2	Carme Àlvarez, Maria J. Blesa, Maria J. Serna	Universal stability of undirected graphs in the adversarial queueing model.	SPAA	2002	DBLP DOI BibTeX RDF	adversarial queueing, greedy protocols, packet switched networks, network stability
2	Ulrich Meyer	External memory BFS on undirected graphs with bounded degree.	SODA	2001	DBLP DOI BibTeX RDF
2	Roy Armoni, Amnon Ta-Shma, Avi Wigderson, Shiyu Zhou	An O(log(n)4/3) space algorithm for (s, t) connectivity in undirected graphs.	J. ACM	2000	DBLP DOI BibTeX RDF	short pseudorandom walks on graphs, undirected graph connectivity, computational complexity, derandomization, space bounded computations
2	Chaoyi Pang, Kotagiri Ramamohanarao, Guozhu Dong	Incremental FO(+, <) Maintenance of All-Pairs Shortest Paths for Undirected Graphs after Insertions and Deletions.	ICDT	1999	DBLP DOI BibTeX RDF
2	Avi Shoshan, Uri Zwick	All Pairs Shortest Paths in Undirected Graphs with Integer Weights.	FOCS	1999	DBLP DOI BibTeX RDF	shortest paths, graph algorithms, matrix multiplication
2	Tzong-Wann Kao, Shi-Jinn Horng	Computing Dominators and Its Applications on Processor Arrays with Reconfigurable Bus Systems.	ISPAN	1996	DBLP DOI BibTeX RDF	bridge-connected components, reconfigurable bus system, dominator, undirected graphs, bridge, dominator tree, biconnected components, articulation point
2	Vineet Bafna, Piotr Berman, Toshihiro Fujito	Constant Ratio Approximations of the Weighted Feedback Vertex Set Problem for Undirected Graphs.	ISAAC	1995	DBLP DOI BibTeX RDF
1	Bang Ye Wu, Jun-Lin Guo, Yue-Li Wang	A linear time algorithm for the next-to-shortest path problem on undirected graphs with nonnegative edge lengths	CoRR	2012	DBLP BibTeX RDF
1	Hemant Kowshik, P. R. Kumar	Optimal Function Computation in Directed and Undirected Graphs.	IEEE Transactions on Information Theory	2012	DBLP DOI BibTeX RDF
1	Aaron Bernstein	Near linear time (1 + ε)-approximation for restricted shortest paths in undirected graphs.	SODA	2012	DBLP BibTeX RDF
1	Julia Chuzhoy	Routing in undirected graphs with constant congestion.	STOC	2012	DBLP DOI BibTeX RDF
1	Mladen Kolar, Eric P. Xing	On Time Varying Undirected Graphs.	Journal of Machine Learning Research - Proceedings Track	2011	DBLP BibTeX RDF
1	Demetres Christofides, Klas Markström	The Guessing Number of Undirected Graphs.	Electr. J. Comb.	2011	DBLP BibTeX RDF
1	Chandra Chekuri, Guy Even, Anupam Gupta, Danny Segev	Set connectivity problems in undirected graphs and the directed steiner network problem.	ACM Transactions on Algorithms	2011	DBLP DOI BibTeX RDF
1	Hemant Kowshik, P. R. Kumar	Optimal Function Computation in Directed and Undirected Graphs	CoRR	2011	DBLP BibTeX RDF
1	Julia Chuzhoy	Routing in Undirected Graphs with Constant Congestion	CoRR	2011	DBLP BibTeX RDF
1	Colin Cooper, David Ilcinkas, Ralf Klasing, Adrian Kosowski	Derandomizing random walks in undirected graphs using locally fair exploration strategies.	Distributed Computing	2011	DBLP DOI BibTeX RDF
1	Philippe Blanchard, Dimitri Volchenkov	Fair and Biased Random Walks on Undirected Graphs and Related Entropies.	Towards an Information Theory of Complex Networks	2011	DBLP DOI BibTeX RDF
1	Rui A. Ferreira, Roberto Grossi, Romeo Rizzi	Output-Sensitive Listing of Bounded-Size Trees in Undirected Graphs.	ESA	2011	DBLP DOI BibTeX RDF
1	Maxim A. Babenko, Alexey Gusakov	New Exact and Approximation Algorithms for the Star Packing Problem in Undirected Graphs.	STACS	2011	DBLP DOI BibTeX RDF
1	Paul Christiano, Jonathan A. Kelner, Aleksander Madry, Daniel A. Spielman, Shang-Hua Teng	Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs.	STOC	2011	DBLP DOI BibTeX RDF
1	Toshimasa Ishii, Yoko Akiyama, Hiroshi Nagamochi	Minimum Augmentation of Edge-Connectivity between Vertices and Sets of Vertices in Undirected Graphs.	Algorithmica	2010	DBLP DOI BibTeX RDF
1	Steen A. Andersson, Thomas Klein	On Riesz and Wishart distributions associated with decomposable undirected graphs.	J. Multivariate Analysis	2010	DBLP DOI BibTeX RDF
1	Shuheng Zhou, John D. Lafferty, Larry A. Wasserman	Time varying undirected graphs.	Machine Learning	2010	DBLP DOI BibTeX RDF
1	Matthew Andrews, Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khanna, Kunal Talwar, Lisa Zhang	Inapproximability of Edge-Disjoint Paths and low congestion routing on undirected graphs.	Combinatorica	2010	DBLP DOI BibTeX RDF
1	Aleksander Madry	Fast Approximation Algorithms for Cut-based Problems in Undirected Graphs	CoRR	2010	DBLP BibTeX RDF
1	Eric Sopena	Upper oriented chromatic number of undirected graphs and oriented colorings of product graphs	CoRR	2010	DBLP BibTeX RDF
1	Paul Christiano, Jonathan A. Kelner, Aleksander Madry, Daniel A. Spielman, Shang-Hua Teng	Electrical Flows, Laplacian Systems, and Faster Approximation of Maximum Flow in Undirected Graphs	CoRR	2010	DBLP BibTeX RDF
1	Surender Baswana, Telikepalli Kavitha	Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs.	SIAM J. Comput.	2010	DBLP DOI BibTeX RDF
1	Jonas Richiardi, Dimitri Van De Ville, Kaspar Riesen, Horst Bunke	Vector Space Embedding of Undirected Graphs with Fixed-cardinality Vertex Sequences for Classification.	ICPR	2010	DBLP DOI BibTeX RDF
1	Manuel Igelmo, Alberto Sanfeliu, Miquel Ferrer	A Conductance Electrical Model for Representing and Matching Weighted Undirected Graphs.	ICPR	2010	DBLP DOI BibTeX RDF
1	Edoardo Amaldi, Claudio Iuliano, Romeo Rizzi	Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs.	IPCO	2010	DBLP DOI BibTeX RDF
1	Aleksander Madry	Fast Approximation Algorithms for Cut-Based Problems in Undirected Graphs.	FOCS	2010	DBLP DOI BibTeX RDF
1	Weiren Yu, Xuemin Lin, Jiajin Le	Taming Computational Complexity: Efficient and Parallel SimRank Optimizations on Undirected Graphs.	WAIM	2010	DBLP DOI BibTeX RDF
1	Sergio Cabello, Éric Colin de Verdière, Francis Lazarus	Finding shortest non-trivial cycles in directed graphs on surfaces.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	embedded graph, non-contractible cycle, non-separating cycle, directed graph, surface, computational topology, topological graph theory
1	Carmen C. Centeno, Mitre Costa Dourado, Jayme Luiz Szwarcfiter	On the Convexity of Paths of Length Two in Undirected Graphs.	Electronic Notes in Discrete Mathematics	2009	DBLP DOI BibTeX RDF
1	Peng Xiao, Yinfeng Xu, Bing Su	Finding an anti-risk path between two nodes in undirected graphs.	J. Comb. Optim.	2009	DBLP DOI BibTeX RDF	Most vital real time edge, Anti-risk path, Shortest path, Shortest path tree
1	Toshimasa Ishii	Minimum augmentation of edge-connectivity with monotone requirements in undirected graphs.	Discrete Optimization	2009	DBLP DOI BibTeX RDF
1	Andrzej Lingas, Eva-Marta Lundell	Efficient approximation algorithms for shortest cycles in undirected graphs.	Inf. Process. Lett.	2009	DBLP DOI BibTeX RDF
1	Han Liu, John D. Lafferty, Larry A. Wasserman	The Nonparanormal: Semiparametric Estimation of High Dimensional Undirected Graphs.	Journal of Machine Learning Research	2009	DBLP DOI BibTeX RDF
1	Jurek Czyzowicz, Stefan Dobrev, Leszek Gasieniec, David Ilcinkas, Jesper Jansson, Ralf Klasing, Yannis Lignos, Russell A. Martin, Kunihiko Sadakane, Wing-Kin Sung	More efficient periodic traversal in anonymous undirected graphs	CoRR	2009	DBLP BibTeX RDF
1	Pierre Charbit, Fabien de Montgolfier, Mathieu Raffinot	A Simple Linear Time Split Decomposition Algorithm of Undirected Graphs	CoRR	2009	DBLP BibTeX RDF
1	Walid Belkhir	Undirected Graphs of Entanglement 3	CoRR	2009	DBLP BibTeX RDF
1	Muhammad Aasim Qureshi, Dr. Fadzil B. Hassan, Sohail Safdar, Rehan Akbar	A O(E) Time Shortest Path Algorithm For Non Negative Weighted Undirected Graphs	CoRR	2009	DBLP BibTeX RDF
1	Toshimasa Ishii	Greedy approximation for the source location problem with vertex-connectivity requirements in undirected graphs.	J. Discrete Algorithms	2009	DBLP DOI BibTeX RDF
1	Xiaofeng Gu, Kamesh Madduri, K. Subramani, Hong-Jian Lai	Improved Algorithms for Detecting Negative Cost Cycles in Undirected Graphs.	FAW	2009	DBLP DOI BibTeX RDF
1	Muhammad Aasim Qureshi, Mohd. Fadzil Hassan, Sohail Safdar, Rehan Akbar, Rabia Sammi	An edge-wise linear shortest path algorithm for non negative weighted undirected graphs.	FIT	2009	DBLP DOI BibTeX RDF
1	Colin Cooper, David Ilcinkas, Ralf Klasing, Adrian Kosowski	Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies.	ICALP	2009	DBLP DOI BibTeX RDF
1	Jurek Czyzowicz, Stefan Dobrev, Leszek Gasieniec, David Ilcinkas, Jesper Jansson, Ralf Klasing, Ioannis Lignos, Russell A. Martin, Kunihiko Sadakane, Wing-Kin Sung	More Efficient Periodic Traversal in Anonymous Undirected Graphs.	SIROCCO	2009	DBLP DOI BibTeX RDF
1	Brian Thompson, Danfeng Yao	The union-split algorithm and cluster-based anonymization of social networks.	ASIACCS	2009	DBLP DOI BibTeX RDF	graph anonymization, social networks, clustering algorithms, social role
1	Vibhav Vineet, Pawan Harish, Suryakant Patidar, P. J. Narayanan	Fast minimum spanning tree for large graphs on the GPU.	High Performance Graphics	2009	DBLP DOI BibTeX RDF
1	Sushmita Roy, Terran Lane, Margaret Werner-Washburne	Learning structurally consistent undirected probabilistic graphical models.	ICML	2009	DBLP DOI BibTeX RDF
1	Pranav K. Vasishta, Prasant Gopal, Anuj Gupta, Piyush Bansal, K. Srinathan	Brief announcement: topology knowledge affects probabilistic reliable communication.	PODC	2009	DBLP DOI BibTeX RDF	probabilistic reliable communication, topology knowledge, directed networks
1	Siddharth Barman, Shuchi Chawla	Packing multiway cuts in capacitated graphs.	SODA	2009	DBLP DOI BibTeX RDF
1	Ariel Kulik, Hadas Shachnai, Tami Tamir	Maximizing submodular set functions subject to multiple linear constraints.	SODA	2009	DBLP DOI BibTeX RDF
1	Zeev Nutov	An almost O(log k)-approximation for k-connected subgraphs.	SODA	2009	DBLP DOI BibTeX RDF
1	Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko	Non-monotone submodular maximization under matroid and knapsack constraints.	STOC	2009	DBLP DOI BibTeX RDF	approximation algorithms, matroids, knapsacks, submodular functions
1	Alan Taylor, Desmond J. Higham	CONTEST: A Controllable Test Matrix Toolbox for MATLAB.	ACM Trans. Math. Softw.	2009	DBLP DOI BibTeX RDF	clustering, random graph, small-world, sparse matrix, matrix computation, preferential attachment, rewiring
1	Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis	Self-stabilizing minimum-degree spanning tree within one from the optimal degree.	IPDPS	2009	DBLP DOI BibTeX RDF
1	Franco Scarselli, Marco Gori, Ah Chung Tsoi, Markus Hagenbuchner, Gabriele Monfardini	Computational Capabilities of Graph Neural Networks.	IEEE Transactions on Neural Networks	2009	DBLP DOI BibTeX RDF
1	David M. Monarres, Michael E. O'Sullivan	A Generalization of the Zig-Zag Graph Product by Means of the Sandwich Product.	AAECC	2009	DBLP DOI BibTeX RDF
1	Visa Holopainen, Raimo Kantola	Tackling the Delay-Cost and Time-Cost Trade-Offs in Computation of Node-Protected Multicast Tree Pairs.	APNOMS	2009	DBLP DOI BibTeX RDF	Redundant/Protected/Disjoint/Colored Multicast/Steiner trees, Heuristics, Cluster computing, Protection, Multipath routing
1	Magnus Wahlström	New Plain-Exponential Time Classes for Graph Homomorphism.	CSR	2009	DBLP DOI BibTeX RDF
1	Erich Grädel, Lukasz Kaiser, Roman Rabinovich	Directed Graphs of Entanglement Two.	FCT	2009	DBLP DOI BibTeX RDF
1	Erik D. Demaine, Gad M. Landau, Oren Weimann	On Cartesian Trees and Range Minimum Queries.	ICALP	2009	DBLP DOI BibTeX RDF
1	Samir Khuller, Barna Saha	On Finding Dense Subgraphs.	ICALP	2009	DBLP DOI BibTeX RDF
1	Dariusz R. Kowalski, Andrzej Pelc	Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps.	ICALP	2009	DBLP DOI BibTeX RDF
1	Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf Niedermeier	A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems.	MFCS	2009	DBLP DOI BibTeX RDF
1	Adrian Kosowski, Alfredo Navarra, Maria Cristina Pinotti	Synchronization Helps Robots to Detect Black Holes in Directed Graphs.	OPODIS	2009	DBLP DOI BibTeX RDF
1	Spyros Angelopoulos	Online Priority Steiner Tree Problems.	WADS	2009	DBLP DOI BibTeX RDF
1	Mathias Weller, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann	On Making Directed Graphs Transitive.	WADS	2009	DBLP DOI BibTeX RDF
1	Erez Kantor, David Peleg	Efficient k-Shot Broadcasting in Radio Networks.	DISC	2009	DBLP DOI BibTeX RDF
1	Adan Cosgaya-Lozano, Norbert Zeh	A Heuristic Strong Connectivity Algorithm for Large Graphs.	SEA	2009	DBLP DOI BibTeX RDF
1	Eyal Kaplan, Moni Naor, Omer Reingold	Derandomized Constructions of k-Wise (Almost) Independent Permutations.	Algorithmica	2009	DBLP DOI BibTeX RDF	Card shuffling, Connectivity, Block ciphers, Random walk, Pseudo-randomness
1	Chandra Chekuri, Guy Even, Anupam Gupta, Danny Segev	Set connectivity problems in undirected graphs and the directed Steiner network problem.	SODA	2008	DBLP DOI BibTeX RDF
1	Andrzej Lingas, Eva-Marta Lundell	Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs.	LATIN	2008	DBLP DOI BibTeX RDF
1	Shuheng Zhou, John D. Lafferty, Larry A. Wasserman	Time Varying Undirected Graphs.	COLT	2008	DBLP BibTeX RDF
1	Matthew Andrews, Lisa Zhang	Almost-tight hardness of directed congestion minimization.	J. ACM	2008	DBLP DOI BibTeX RDF	Hardness of approximation, undirected graphs, congestion minimization
1	Susanne Albers	On the value of coordination in network design.	SODA	2008	DBLP DOI BibTeX RDF
1	Anand Bhalgat, Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi	Fast edge splitting and Edmonds' arborescence construction for unweighted graphs.	SODA	2008	DBLP DOI BibTeX RDF
1	Chandra Chekuri, Nitish Korula, Martin Pál	Improved algorithms for orienteering and related problems.	SODA	2008	DBLP DOI BibTeX RDF
1	Ho-Lin Chen, Tim Roughgarden, Gregory Valiant	Designing networks with good equilibria.	SODA	2008	DBLP DOI BibTeX RDF
1	Nikhil Bansal, Rohit Khandekar, Viswanath Nagarajan	Additive guarantees for degree bounded directed network design.	STOC	2008	DBLP DOI BibTeX RDF	approximation algorithms, directed graphs, network design
1	Jittat Fakcharoenphol, Bundit Laekhanukit	An o(log2 k)-approximation algorithm for the k-vertex connected spanning subgraph problem.	STOC	2008	DBLP DOI BibTeX RDF	approximation algorithms for NP-hard problems, k-connected spanning subgraphs, network design
1	Harald Räcke	Optimal hierarchical decompositions for congestion minimization in networks.	STOC	2008	DBLP DOI BibTeX RDF	approximating metrics by tree metrics, oblivious routing
1	Omer Reingold	Undirected connectivity in log-space.	J. ACM	2008	DBLP DOI BibTeX RDF	bounded space algorithms, Derandomization, pseudorandom generator
1	Tim Nieberg, Johann Hurink, Walter Kern	Approximation schemes for wireless networks.	ACM Transactions on Algorithms	2008	DBLP DOI BibTeX RDF	bounded growth, Wireless ad-hoc networks, PTAS, maximum independent set, minimum dominating set
1	Liam Roditty, Mikkel Thorup, Uri Zwick	Roundtrip spanners and roundtrip routing in directed graphs.	ACM Transactions on Algorithms	2008	DBLP DOI BibTeX RDF	roundtrip, Routing, shortest paths, distances, spanners
1	Toon Calders, Jan Ramon, Dries Van Dyck	Anti-monotonic Overlap-Graph Support Measures.	ICDM	2008	DBLP DOI BibTeX RDF