The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase directed graphs (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1960-1975 (16) 1976-1980 (20) 1981-1985 (19) 1986-1988 (33) 1989 (16) 1990 (18) 1991-1992 (33) 1993 (24) 1994 (29) 1995 (25) 1996-1997 (30) 1998 (16) 1999-2000 (45) 2001 (34) 2002 (33) 2003 (36) 2004 (37) 2005 (61) 2006 (57) 2007 (82) 2008 (66) 2009 (66) 2010 (29) 2011 (27) 2012 (37) 2013 (45) 2014 (41) 2015 (72) 2016 (76) 2017 (68) 2018 (83) 2019 (17)
Publication types (Num. hits)
article(601) book(1) incollection(22) inproceedings(662) phdthesis(5)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 1068 occurrences of 639 keywords

Results
Found 1291 publication records. Showing 1291 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
63Tamara Munzner H3: laying out large directed graphs in 3D hyperbolic space. Search on Bibsonomy INFOVIS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF large directed graphs, 3D hyperbolic space, H3 layout technique, euclidean 3-space, cone tree layout algorithm, hyperbolic navigation, subtree pruning, optimization, directed graphs, data visualization, spanning tree, graph drawing, hierarchical data, node-link diagrams, visual clutter, domain-specific knowledge
61Erich Grädel, Lukasz Kaiser, Roman Rabinovich Directed Graphs of Entanglement Two. Search on Bibsonomy FCT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
61Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Harald Räcke, Tom Leighton Oblivious routing on node-capacitated and directed graphs. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2007 DBLP  DOI  BibTeX  RDF node-capacitated graphs, directed graphs, communication networks, Oblivious routing
60Andreas Jakoby, Till Tantau Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs. Search on Bibsonomy FSTTCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF logspace algorithms, distance problem, longest path problem, bounded tree-width, K 4-minor-free graphs, Series-parallel graphs
56Emden R. Gansner, Eleftherios Koutsofios, Stephen C. North, Kiem-Phong Vo A Technique for Drawing Directed Graphs. Search on Bibsonomy IEEE Trans. Software Eng. The full citation details ... 1993 DBLP  DOI  BibTeX  RDF four-pass algorithm, optimal rank assignment, network simplex algorithm, vertex order, iterative heuristic, novel weight function, local transpositions, optimal coordinates, auxiliary graph, computer graphics, optimisation, directed graphs, directed graphs, splines, splines (mathematics)
52Joseph Naor, Baruch Schieber Improved Approximations for Shallow-Light Spanning Trees. Search on Bibsonomy FOCS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF shallow-light spanning trees, bicriteria optimization, non-trivial approximation factors, information retrieval, directed graphs, directed graph, directed graphs, polynomial time algorithm, VLSI design
52Moses Charikar, Konstantin Makarychev, Yury Makarychev Directed metrics and directed graph partitioning problems. Search on Bibsonomy SODA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
52Zhilin Wu, Stéphane Grumbach Feasibility of Motion Planning on Directed Graphs. Search on Bibsonomy TAMC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
51Tim Dwyer, Yehuda Koren, Kim Marriott Drawing Directed Graphs Using Quadratic Programming. Search on Bibsonomy IEEE Trans. Vis. Comput. Graph. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF force directed algorithms, Directed graphs, hierarchy, graph drawing, quadratic programming, majorization
51Mohammad Taghi Hajiaghayi, Jeong Han Kim, Tom Leighton, Harald Räcke Oblivious routing in directed graphs with random demands. Search on Bibsonomy STOC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF demand distributions, directed graphs, oblivious routing
50Alejandro Estrella-Balderrama, Fabrizio Frati, Stephen G. Kobourov Upward Straight-Line Embeddings of Directed Graphs into Point Sets. Search on Bibsonomy WG The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
49Liam Roditty, Uri Zwick A fully dynamic reachability algorithm for directed graphs with an almost linear update time. Search on Bibsonomy STOC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF directed graphs, reachability, transitive closure, dynamic graphs algorithms
48Yuval Emek, David Peleg, Liam Roditty A near-linear time algorithm for computing replacement paths in planar directed graphs. Search on Bibsonomy SODA The full citation details ... 2008 DBLP  BibTeX  RDF
48Hortensia Galeana-Sánchez, César Hernández-Cruz Quasi-Transitive Digraphs and Their Extensions. Search on Bibsonomy Classes of Directed Graphs The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
48Jørgen Bang-Jensen, Frédéric Havet Tournaments and Semicomplete Digraphs. Search on Bibsonomy Classes of Directed Graphs The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
48Yubao Guo, Michel Surmacs Miscellaneous Digraph Classes. Search on Bibsonomy Classes of Directed Graphs The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
48Gregory Z. Gutin Acyclic Digraphs. Search on Bibsonomy Classes of Directed Graphs The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
48Marcin Pilipczuk, Michal Pilipczuk Planar Digraphs. Search on Bibsonomy Classes of Directed Graphs The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
48Stephan Kreutzer, O-joung Kwon Digraphs of Bounded Width. Search on Bibsonomy Classes of Directed Graphs The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
48Richard H. Hammack Digraphs Products. Search on Bibsonomy Classes of Directed Graphs The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
48Magnus Wahlström Euler Digraphs. Search on Bibsonomy Classes of Directed Graphs The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
48Jørgen Bang-Jensen Locally Semicomplete Digraphs and Generalizations. Search on Bibsonomy Classes of Directed Graphs The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
48Jørgen Bang-Jensen, Gregory Z. Gutin Basic Terminology, Notation and Results. Search on Bibsonomy Classes of Directed Graphs The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
48Anders Yeo Semicomplete Multipartite Digraphs. Search on Bibsonomy Classes of Directed Graphs The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
48Jing Huang Lexicographic Orientation Algorithms. Search on Bibsonomy Classes of Directed Graphs The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
48Rasool Jalili, Frans A. Henskens Using directed graphs to describe entity dependency in stable distributed persistent stores. Search on Bibsonomy HICSS (2) The full citation details ... 1995 DBLP  DOI  BibTeX  RDF entity dependency, distributed persistent stores, roll-back, stability, fault tolerant computing, dependency, object-oriented databases, checkpoint, directed graphs, directed graphs, database theory, fault-tolerant systems, persistent systems, persistent object store
46Guy Even, Guy Kortsarz, Wolfgang Slany On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem. Search on Bibsonomy SWAT The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
45Richard Steiner The algebra of directed complexes. Search on Bibsonomy Applied Categorical Structures The full citation details ... 1993 DBLP  DOI  BibTeX  RDF Directed complex, parity complex, globelike, split set, frame dimension, totally loop-free, atom, category, category, molecule, loop-free
45Reid Andersen, Fan R. K. Chung, Kevin J. Lang Local Partitioning for Directed Graphs Using PageRank. Search on Bibsonomy WAW The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
44Olivier Déforges, Dominique Barba Segmentation of Complex Documents Multilevel Images: A Robust and Fast Text Bodies-Headers Detection and Extraction Scheme 770. Search on Bibsonomy ICDAR The full citation details ... 1995 DBLP  DOI  BibTeX  RDF complex documents multilevel images segmentation, text bodies-headers detection, text bodies-headers extraction, text paragraphs, stroke structures, pyramid representation, line borders detection scheme, bottom-up procedure, algebric transformations, image segmentation, feature extraction, directed graphs, directed graphs, document image processing, multiscale analysis
43Julia Chuzhoy, Sanjeev Khanna Hardness of cut problems in directed graphs. Search on Bibsonomy STOC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF directed multicut, hardness of approximation, sparsest cut
42Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton, Harald Räcke Oblivious routing on node-capacitated and directed graphs. Search on Bibsonomy SODA The full citation details ... 2005 DBLP  BibTeX  RDF
41Guy Even, Guy Kortsarz, Wolfgang Slany On network design problems: fixed cost flows and the covering steiner problem. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Optimization, approximation, graphs, theory, flow
41Michael A. Bender, Dana Ron Testing Acyclicity of Directed Graphs in Sublinear Time. Search on Bibsonomy ICALP The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
40Liam Roditty, Mikkel Thorup, Uri Zwick Roundtrip spanners and roundtrip routing in directed graphs. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2008 DBLP  DOI  BibTeX  RDF roundtrip, Routing, shortest paths, distances, spanners
40Liam Roditty, Mikkel Thorup, Uri Zwick Roundtrip spanners and roundtrip routing in directed graphs. Search on Bibsonomy SODA The full citation details ... 2002 DBLP  BibTeX  RDF
40Lars Arge, Laura Toma, Norbert Zeh I/O-efficient topological sorting of planar DAGs. Search on Bibsonomy SPAA The full citation details ... 2003 DBLP  DOI  BibTeX  RDF I/O-efficient algorithms, planar directed graphs, graph algorithms, topological sorting, ear decomposition
40Joachim Kneis, Alexander Langer, Peter Rossmanith A New Algorithm for Finding Trees with Many Leaves. Search on Bibsonomy ISAAC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
40Dietmar Berwanger, Anuj Dawar, Paul Hunter, Stephan Kreutzer DAG-Width and Parity Games. Search on Bibsonomy STACS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
40Omer Reingold, Luca Trevisan, Salil P. Vadhan Pseudorandom walks on regular digraphs and the RL vs. L problem. Search on Bibsonomy STOC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF universal traversal sequence, zig-zag product, derandomization, expander graphs, mixing time, space-bounded computation
40Moses Charikar Greedy approximation algorithms for finding dense components in a graph. Search on Bibsonomy APPROX The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
39Venkatesh Raman 0001, Saket Saurabh 0001 Parameterized Complexity of Directed Feedback Set Problems in Tournaments. Search on Bibsonomy WADS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
39Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk Space Efficient Algorithms for Series-Parallel Graphs. Search on Bibsonomy STACS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
39Jan Obdrzálek DAG-width: connectivity measure for directed graphs. Search on Bibsonomy SODA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
39M. Fatih Demirci, Ali Shokoufandeh, Sven J. Dickinson, Yakov Keselman, Lars Bretzner Many-to-Many Feature Matching Using Spherical Coding of Directed Graphs. Search on Bibsonomy ECCV (1) The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
39Ulrich Meyer 0001 Single-source shortest-paths on arbitrary directed graphs in linear average-case time. Search on Bibsonomy SODA The full citation details ... 2001 DBLP  BibTeX  RDF
39Guy Kortsarz, Zeev Nutov Approximating Node Connectivity Problems via Set Covers. Search on Bibsonomy Algorithmica The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Vertex connected spanning subgraph, Metric costs, Approximation algorithms
38Guy Even, Joseph Naor, Baruch Schieber, Madhu Sudan Approximating Minimum Feedback Sets and Multi-Cuts in Directed Graphs. Search on Bibsonomy IPCO The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
38Daniel Meister 0001, Jan Arne Telle, Martin Vatshelle Characterization and Recognition of Digraphs of Bounded Kelly-width. Search on Bibsonomy WG The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
38Dan C. Clarke An augmented directed graph base for application development. Search on Bibsonomy ACM Southeast Regional Conference The full citation details ... 1982 DBLP  DOI  BibTeX  RDF
38D. G. McVitie, L. B. Wilson The Stable Marriage Problem. Search on Bibsonomy Commun. ACM The full citation details ... 1971 DBLP  DOI  BibTeX  RDF
38Marco Baioletti, Giuseppe Busanello, Barbara Vantaggi Acyclic Directed Graphs to Represent Conditional Independence Models. Search on Bibsonomy ECSQARU The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Conditional independence models, Graphoid properties, Inferential rules, Acyclic directed graphs, Perfect map
38Jop F. Sibeyn, James Abello, Ulrich Meyer 0001 Heuristics for semi-external depth first search on directed graphs. Search on Bibsonomy SPAA The full citation details ... 2002 DBLP  DOI  BibTeX  RDF strong components, graph algorithms, depth first search, external memory
37Chandra Chekuri, Sanjeev Khanna Edge-disjoint paths revisited. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2007 DBLP  DOI  BibTeX  RDF multicommodity flow relaxation, approximation algorithm, greedy algorithm, Edge-disjoint paths
37Chandra Chekuri, Sanjeev Khanna Edge disjoint paths revisited. Search on Bibsonomy SODA The full citation details ... 2003 DBLP  BibTeX  RDF
37Julia Chuzhoy, Sanjeev Khanna Polynomial flow-cut gaps and hardness of directed cut problems. Search on Bibsonomy J. ACM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Directed multicut, hardness of approximation, sparsest cut
37Julia Chuzhoy, Sanjeev Khanna Polynomial flow-cut gaps and hardness of directed cut problems. Search on Bibsonomy STOC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF concurrent flow, directed multicut, directed sparsest cut, flow-cut gaps, hardness of approximation, multicommodity flow
36Camil Demetrescu, Giuseppe F. Italiano Fully Dynamic Transitive Closure: Breaking Through the O(n2) Barrier. Search on Bibsonomy FOCS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF fully dynamic transitive closure, unit worst-case cost, amortized time, single-operation complexity, subquadratic algorithm, computational complexity, randomized algorithm, queries, directed graphs, directed graphs, polynomials, polynomials, directed acyclic graphs, matrix multiplication, matrix multiplication, deterministic algorithms, deterministic algorithm, randomised algorithms
36Frédéric Rousseau, J. M. Bergé, Michel Israël Hardware/Software Partitioning for Telecommunications Systems. Search on Bibsonomy COMPSAC The full citation details ... 1996 DBLP  DOI  BibTeX  RDF echo suppression, dataflow systems, list scheduling algorithm, force calculation, acoustic echo canceller, scheduling, real-time systems, embedded systems, resource allocation, resource allocation, system design, logic design, systems analysis, directed graphs, directed graphs, telecommunication, task scheduling, assignment, precedence constraints, telecommunication computing, hardware software partitioning, telecommunications systems
36Guy Even, Joseph Naor, Satish Rao, Baruch Schieber Divide-and-Conquer Approximation Algorithms via Spreading Metrics (Extended Abstract). Search on Bibsonomy FOCS The full citation details ... 1995 DBLP  DOI  BibTeX  RDF divide-and-conquer approximation algorithms, spreading metrics, NP-hard graph optimization problems, graph optimization problems, fractional spreading metric, fractional lengths, optimisation problem, spreading metric, interval graph completion, storage-time product, computational complexity, optimisation, directed graphs, directed graphs, polynomial time, vertices, divide and conquer methods, multicuts, polynomial time approximation algorithm
36Thomas L. Casavant, Jon G. Kuhl A Communicating Finite Automata Approach to Modeling Distributed Computation and Its Application to Distributed Decision-Making. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 1990 DBLP  DOI  BibTeX  RDF communicating finite automata approach, standard specification mechanism, distribution scheduling algorithms, scheduling, modeling, formal specification, distributed computation, directed graphs, directed graphs, finite automata, distributed decision-making
36Joseph Naor, Roy Schwartz The directed circular arrangement problem. Search on Bibsonomy SODA The full citation details ... 2004 DBLP  BibTeX  RDF
36Herman J. Haverkort, Laura Toma I/O-Efficient Algorithms on Near-Planar Graphs. Search on Bibsonomy LATIN The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
36Uri Zwick All Pairs Shortest Paths in Weighted Directed Graphs ¾ Exact and Almost Exact Algorithms. Search on Bibsonomy FOCS The full citation details ... 1998 DBLP  DOI  BibTeX  RDF Bridging sets, Randomized algorithms, Shortest paths, Matrix multiplication
35Mamadou Moustapha Kanté, Michaël Rao Directed Rank-Width and Displit Decomposition. Search on Bibsonomy WG The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
35Martin Hülse Generating Complex Connectivity Structures for Large-Scale Neural Models. Search on Bibsonomy ICANN (2) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
35Guy Kortsarz, Zeev Nutov Approximation algorithm for k-node connected subgraphs via critical graphs. Search on Bibsonomy STOC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
35Georg Gottlob, Phokion G. Kolaitis, Thomas Schwentick Existential second-order logic over graphs: Charting the tractability frontier. Search on Bibsonomy J. ACM The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Existential second-order logic, graph constraints, prefix classes, graph coloring, NP-complete problems, finite model theory
34Chandra Chekuri, Martin Pál A Recursive Greedy Algorithm for Walks in Directed Graphs. Search on Bibsonomy FOCS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
33Samir Khuller, Barna Saha On Finding Dense Subgraphs. Search on Bibsonomy ICALP (1) The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
32Adrian Kosowski, Alfredo Navarra, Maria Cristina Pinotti Synchronization Helps Robots to Detect Black Holes in Directed Graphs. Search on Bibsonomy OPODIS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
32Amos Beimel, Anat Paskin On Linear Secret Sharing for Connectivity in Directed Graphs. Search on Bibsonomy SCN The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
32Telikepalli Kavitha, Kurt Mehlhorn Algorithms to Compute Minimum Cycle Basis in Directed Graphs. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
32Mohammad R. Salavatipour, Jacques Verstraëte Disjoint Cycles: Integrality Gap, Hardness, and Approximation. Search on Bibsonomy IPCO The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
32Andreas Björklund, Thore Husfeldt, Sanjeev Khanna Approximating Longest Directed Paths and Cycles. Search on Bibsonomy ICALP The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
32Stavros G. Kolliopoulos, Clifford Stein Improved Approximation Algorithms for Unsplittable Flow Problems. Search on Bibsonomy FOCS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
31Viswanath Nagarajan, R. Ravi 0001 The Directed Minimum Latency Problem. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
31Bruno Bachelet, Philippe Mahey Minimum convex piecewise linear cost tension problem on quasi-k series-parallel graphs. Search on Bibsonomy 4OR The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Minimum cost tension, two-terminal series-parallel digraph, series-parallel recognition, out-of-kilter algorithm, graph decomposition
31Yonghong Chen, Xing Liu, Vaithianathan Mani Venkatasubramanian Fast Algorithms for Detecting Circular VAR Flows in Large Power-Flow Models. Search on Bibsonomy HICSS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Loop flows, power-flow studies, Directed graphs, depth-first search, electric power system
31Till Tantau A Logspace Approximation Scheme for the Shortest Path Problem for Graphs with Bounded Independence Number. Search on Bibsonomy STACS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
30Martin Harrigan, Patrick Healy Efficiently drawing a significant spanning tree of a directed graph. Search on Bibsonomy APVIS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
30Joseph Cheriyan, John H. Reif Directed s-t Bumberings, Rubber Bands, and Testing Digraph k-Vertex Connectivity. Search on Bibsonomy SODA The full citation details ... 1992 DBLP  BibTeX  RDF
30Réka Albert, Bhaskar DasGupta, Riccardo Dondi, Eduardo D. Sontag Inferring (Biological) Signal Transduction Networks via Transitive Reductions of Directed Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Transitive reduction of directed graphs, Minimum equivalent digraph, (Biological) signal transduction networks, Approximation algorithms
30Alex R. Berg, Tibor Jordán Minimally k-Edge-Connected Directed Graphs of Maximal Size. Search on Bibsonomy Graphs and Combinatorics The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Minimally k-edge-connected, Directed graphs, Edge-connectivity
30Noga Alon, Asaf Shapira Testing subgraphs in directed graphs. Search on Bibsonomy STOC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF directed graphs, property testing, regularity lemma
30Baruch Awerbuch, Yuval Shavitt Topology aggregation for directed graphs. Search on Bibsonomy IEEE/ACM Trans. Netw. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF graph theory, asynchronous transfer mode, topology, directed graphs, wide-area networks, communication system routing, PNNI
30Michael A. Bender, Donna K. Slonim The Power of Team Exploration: Two Robots Can Learn Unlabeled Directed Graphs Search on Bibsonomy FOCS The full citation details ... 1994 DBLP  DOI  BibTeX  RDF random-walk algorithm, team exploration, unlabeled directed graphs, homing sequence, strongly-connected directed graph, random walks, teacher, cooperating robots
30Makoto Imase, Masaki Itoh A Design for Directed Graphs with Minimum Diameter. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 1983 DBLP  DOI  BibTeX  RDF diameter minimization, optimum solution, Computer networks, directed graphs, switching systems
29Ward Douglas Maurer Removing backward go-to statements from Ada programs: possibilities and problems. Search on Bibsonomy SIGAda The full citation details ... 2008 DBLP  DOI  BibTeX  RDF ada compilers, go-to statements, loop trees, directed graphs
29Jeffrey Johns, Sridhar Mahadevan Constructing basis functions from directed graphs for value function approximation. Search on Bibsonomy ICML The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
29Michael E. Saks, Alex Samorodnitsky, Leonid Zosin A Lower Bound On The Integrality Gap For Minimum Multicut In Directed Networks. Search on Bibsonomy Combinatorica The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000): 05C20, 90C35, 90B10
29Edith Hemaspaandra, Holger Spakowski, Mayur Thakur Complexity of Cycle Length Modularity Problems in Graphs. Search on Bibsonomy LATIN The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
28Jeong Han Kim The Poisson Cloning Model for Random Graphs, Random Directed Graphs and Random k-SAT Problems. Search on Bibsonomy COCOON The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
28Eldar Fischer, Oded Lachish, Ilan Newman, Arie Matsliah, Orly Yahalom On the Query Complexity of Testing Orientations for Being Eulerian. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
28Dongsheng Duan, Yuhua Li, Yanan Jin, Zhengding Lu Community mining on dynamic weighted directed graphs. Search on Bibsonomy CIKM-CNIKM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF change-point detection, dynamic weighted directed graph, modularity, compactness, community discovery
28Markus Bläser, Bodo Manthey Approximating Maximum Weight Cycle Covers in Directed Graphs with Weights Zero and One. Search on Bibsonomy Algorithmica The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Approximation algorithms, Combinatorial optimization, Traveling salesman problem, Inapproximability, Cycle covers
28Telikepalli Kavitha, Kurt Mehlhorn A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs. Search on Bibsonomy STACS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
28Liam Roditty, Uri Zwick Replacement Paths and k Simple Shortest Paths in Unweighted Directed Graphs. Search on Bibsonomy ICALP The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
28Raphael Yuster, Uri Zwick Answering distance queries in directed graphs using fast matrix multiplication. Search on Bibsonomy FOCS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
28Liran Carmel, David Harel, Yehuda Koren Combining Hierarchy and Energy Drawing Directed Graphs. Search on Bibsonomy IEEE Trans. Vis. Comput. Graph. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Directed graph drawing, hierarchy energy, Fiedler vector, minimum linear arrangement, force directed layout
Displaying result #1 - #100 of 1291 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license