

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 
63  Tamara Munzner 
H3: laying out large directed graphs in 3D hyperbolic space. 
INFOVIS 
1997 
DBLP DOI BibTeX RDF 
large directed graphs, 3D hyperbolic space, H3 layout technique, euclidean 3space, cone tree layout algorithm, hyperbolic navigation, subtree pruning, optimization, directed graphs, data visualization, spanning tree, graph drawing, hierarchical data, nodelink diagrams, visual clutter, domainspecific knowledge 
61  Erich Grädel, Lukasz Kaiser, Roman Rabinovich 
Directed Graphs of Entanglement Two. 
FCT 
2009 
DBLP DOI BibTeX RDF 

61  Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Harald Räcke, Tom Leighton 
Oblivious routing on nodecapacitated and directed graphs. 
ACM Trans. Algorithms 
2007 
DBLP DOI BibTeX RDF 
nodecapacitated graphs, directed graphs, communication networks, Oblivious routing 
60  Andreas Jakoby, Till Tantau 
Logspace Algorithms for Computing Shortest and Longest Paths in SeriesParallel Graphs. 
FSTTCS 
2007 
DBLP DOI BibTeX RDF 
logspace algorithms, distance problem, longest path problem, bounded treewidth, K 4minorfree graphs, Seriesparallel graphs 
56  Emden R. Gansner, Eleftherios Koutsofios, Stephen C. North, KiemPhong Vo 
A Technique for Drawing Directed Graphs. 
IEEE Trans. Software Eng. 
1993 
DBLP DOI BibTeX RDF 
fourpass 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) 
52  Joseph Naor, Baruch Schieber 
Improved Approximations for ShallowLight Spanning Trees. 
FOCS 
1997 
DBLP DOI BibTeX RDF 
shallowlight spanning trees, bicriteria optimization, nontrivial approximation factors, information retrieval, directed graphs, directed graph, directed graphs, polynomial time algorithm, VLSI design 
52  Moses Charikar, Konstantin Makarychev, Yury Makarychev 
Directed metrics and directed graph partitioning problems. 
SODA 
2006 
DBLP DOI BibTeX RDF 

52  Zhilin Wu, Stéphane Grumbach 
Feasibility of Motion Planning on Directed Graphs. 
TAMC 
2009 
DBLP DOI BibTeX RDF 

51  Tim Dwyer, Yehuda Koren, Kim Marriott 
Drawing Directed Graphs Using Quadratic Programming. 
IEEE Trans. Vis. Comput. Graph. 
2006 
DBLP DOI BibTeX RDF 
force directed algorithms, Directed graphs, hierarchy, graph drawing, quadratic programming, majorization 
51  Mohammad Taghi Hajiaghayi, Jeong Han Kim, Tom Leighton, Harald Räcke 
Oblivious routing in directed graphs with random demands. 
STOC 
2005 
DBLP DOI BibTeX RDF 
demand distributions, directed graphs, oblivious routing 
50  Alejandro EstrellaBalderrama, Fabrizio Frati, Stephen G. Kobourov 
Upward StraightLine Embeddings of Directed Graphs into Point Sets. 
WG 
2008 
DBLP DOI BibTeX RDF 

49  Liam Roditty, Uri Zwick 
A fully dynamic reachability algorithm for directed graphs with an almost linear update time. 
STOC 
2004 
DBLP DOI BibTeX RDF 
directed graphs, reachability, transitive closure, dynamic graphs algorithms 
48  Yuval Emek, David Peleg, Liam Roditty 
A nearlinear time algorithm for computing replacement paths in planar directed graphs. 
SODA 
2008 
DBLP BibTeX RDF 

48  Hortensia GaleanaSánchez, César HernándezCruz 
QuasiTransitive Digraphs and Their Extensions. 
Classes of Directed Graphs 
2018 
DBLP DOI BibTeX RDF 

48  Jørgen BangJensen, Frédéric Havet 
Tournaments and Semicomplete Digraphs. 
Classes of Directed Graphs 
2018 
DBLP DOI BibTeX RDF 

48  Yubao Guo, Michel Surmacs 
Miscellaneous Digraph Classes. 
Classes of Directed Graphs 
2018 
DBLP DOI BibTeX RDF 

48  Gregory Z. Gutin 
Acyclic Digraphs. 
Classes of Directed Graphs 
2018 
DBLP DOI BibTeX RDF 

48  Marcin Pilipczuk, Michal Pilipczuk 
Planar Digraphs. 
Classes of Directed Graphs 
2018 
DBLP DOI BibTeX RDF 

48  Stephan Kreutzer, Ojoung Kwon 
Digraphs of Bounded Width. 
Classes of Directed Graphs 
2018 
DBLP DOI BibTeX RDF 

48  Richard H. Hammack 
Digraphs Products. 
Classes of Directed Graphs 
2018 
DBLP DOI BibTeX RDF 

48  Magnus Wahlström 
Euler Digraphs. 
Classes of Directed Graphs 
2018 
DBLP DOI BibTeX RDF 

48  Jørgen BangJensen 
Locally Semicomplete Digraphs and Generalizations. 
Classes of Directed Graphs 
2018 
DBLP DOI BibTeX RDF 

48  Jørgen BangJensen, Gregory Z. Gutin 
Basic Terminology, Notation and Results. 
Classes of Directed Graphs 
2018 
DBLP DOI BibTeX RDF 

48  Anders Yeo 
Semicomplete Multipartite Digraphs. 
Classes of Directed Graphs 
2018 
DBLP DOI BibTeX RDF 

48  Jing Huang 
Lexicographic Orientation Algorithms. 
Classes of Directed Graphs 
2018 
DBLP DOI BibTeX RDF 

48  Rasool Jalili, Frans A. Henskens 
Using directed graphs to describe entity dependency in stable distributed persistent stores. 
HICSS (2) 
1995 
DBLP DOI BibTeX RDF 
entity dependency, distributed persistent stores, rollback, stability, fault tolerant computing, dependency, objectoriented databases, checkpoint, directed graphs, directed graphs, database theory, faulttolerant systems, persistent systems, persistent object store 
46  Guy Even, Guy Kortsarz, Wolfgang Slany 
On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem. 
SWAT 
2002 
DBLP DOI BibTeX RDF 

45  Richard Steiner 
The algebra of directed complexes. 
Applied Categorical Structures 
1993 
DBLP DOI BibTeX RDF 
Directed complex, parity complex, globelike, split set, frame dimension, totally loopfree, atom, category, category, molecule, loopfree 
45  Reid Andersen, Fan R. K. Chung, Kevin J. Lang 
Local Partitioning for Directed Graphs Using PageRank. 
WAW 
2007 
DBLP DOI BibTeX RDF 

44  Olivier Déforges, Dominique Barba 
Segmentation of Complex Documents Multilevel Images: A Robust and Fast Text BodiesHeaders Detection and Extraction Scheme 770. 
ICDAR 
1995 
DBLP DOI BibTeX RDF 
complex documents multilevel images segmentation, text bodiesheaders detection, text bodiesheaders extraction, text paragraphs, stroke structures, pyramid representation, line borders detection scheme, bottomup procedure, algebric transformations, image segmentation, feature extraction, directed graphs, directed graphs, document image processing, multiscale analysis 
43  Julia Chuzhoy, Sanjeev Khanna 
Hardness of cut problems in directed graphs. 
STOC 
2006 
DBLP DOI BibTeX RDF 
directed multicut, hardness of approximation, sparsest cut 
42  Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton, Harald Räcke 
Oblivious routing on nodecapacitated and directed graphs. 
SODA 
2005 
DBLP BibTeX RDF 

41  Guy Even, Guy Kortsarz, Wolfgang Slany 
On network design problems: fixed cost flows and the covering steiner problem. 
ACM Trans. Algorithms 
2005 
DBLP DOI BibTeX RDF 
Optimization, approximation, graphs, theory, flow 
41  Michael A. Bender, Dana Ron 
Testing Acyclicity of Directed Graphs in Sublinear Time. 
ICALP 
2000 
DBLP DOI BibTeX RDF 

40  Liam Roditty, Mikkel Thorup, Uri Zwick 
Roundtrip spanners and roundtrip routing in directed graphs. 
ACM Trans. Algorithms 
2008 
DBLP DOI BibTeX RDF 
roundtrip, Routing, shortest paths, distances, spanners 
40  Liam Roditty, Mikkel Thorup, Uri Zwick 
Roundtrip spanners and roundtrip routing in directed graphs. 
SODA 
2002 
DBLP BibTeX RDF 

40  Lars Arge, Laura Toma, Norbert Zeh 
I/Oefficient topological sorting of planar DAGs. 
SPAA 
2003 
DBLP DOI BibTeX RDF 
I/Oefficient algorithms, planar directed graphs, graph algorithms, topological sorting, ear decomposition 
40  Joachim Kneis, Alexander Langer, Peter Rossmanith 
A New Algorithm for Finding Trees with Many Leaves. 
ISAAC 
2008 
DBLP DOI BibTeX RDF 

40  Dietmar Berwanger, Anuj Dawar, Paul Hunter, Stephan Kreutzer 
DAGWidth and Parity Games. 
STACS 
2006 
DBLP DOI BibTeX RDF 

40  Omer Reingold, Luca Trevisan, Salil P. Vadhan 
Pseudorandom walks on regular digraphs and the RL vs. L problem. 
STOC 
2006 
DBLP DOI BibTeX RDF 
universal traversal sequence, zigzag product, derandomization, expander graphs, mixing time, spacebounded computation 
40  Moses Charikar 
Greedy approximation algorithms for finding dense components in a graph. 
APPROX 
2000 
DBLP DOI BibTeX RDF 

39  Venkatesh Raman 0001, Saket Saurabh 0001 
Parameterized Complexity of Directed Feedback Set Problems in Tournaments. 
WADS 
2003 
DBLP DOI BibTeX RDF 

39  Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk 
Space Efficient Algorithms for SeriesParallel Graphs. 
STACS 
2001 
DBLP DOI BibTeX RDF 

39  Jan Obdrzálek 
DAGwidth: connectivity measure for directed graphs. 
SODA 
2006 
DBLP DOI BibTeX RDF 

39  M. Fatih Demirci, Ali Shokoufandeh, Sven J. Dickinson, Yakov Keselman, Lars Bretzner 
ManytoMany Feature Matching Using Spherical Coding of Directed Graphs. 
ECCV (1) 
2004 
DBLP DOI BibTeX RDF 

39  Ulrich Meyer 0001 
Singlesource shortestpaths on arbitrary directed graphs in linear averagecase time. 
SODA 
2001 
DBLP BibTeX RDF 

39  Guy Kortsarz, Zeev Nutov 
Approximating Node Connectivity Problems via Set Covers. 
Algorithmica 
2003 
DBLP DOI BibTeX RDF 
Vertex connected spanning subgraph, Metric costs, Approximation algorithms 
38  Guy Even, Joseph Naor, Baruch Schieber, Madhu Sudan 
Approximating Minimum Feedback Sets and MultiCuts in Directed Graphs. 
IPCO 
1995 
DBLP DOI BibTeX RDF 

38  Daniel Meister 0001, Jan Arne Telle, Martin Vatshelle 
Characterization and Recognition of Digraphs of Bounded Kellywidth. 
WG 
2007 
DBLP DOI BibTeX RDF 

38  Dan C. Clarke 
An augmented directed graph base for application development. 
ACM Southeast Regional Conference 
1982 
DBLP DOI BibTeX RDF 

38  D. G. McVitie, L. B. Wilson 
The Stable Marriage Problem. 
Commun. ACM 
1971 
DBLP DOI BibTeX RDF 

38  Marco Baioletti, Giuseppe Busanello, Barbara Vantaggi 
Acyclic Directed Graphs to Represent Conditional Independence Models. 
ECSQARU 
2009 
DBLP DOI BibTeX RDF 
Conditional independence models, Graphoid properties, Inferential rules, Acyclic directed graphs, Perfect map 
38  Jop F. Sibeyn, James Abello, Ulrich Meyer 0001 
Heuristics for semiexternal depth first search on directed graphs. 
SPAA 
2002 
DBLP DOI BibTeX RDF 
strong components, graph algorithms, depth first search, external memory 
37  Chandra Chekuri, Sanjeev Khanna 
Edgedisjoint paths revisited. 
ACM Trans. Algorithms 
2007 
DBLP DOI BibTeX RDF 
multicommodity flow relaxation, approximation algorithm, greedy algorithm, Edgedisjoint paths 
37  Chandra Chekuri, Sanjeev Khanna 
Edge disjoint paths revisited. 
SODA 
2003 
DBLP BibTeX RDF 

37  Julia Chuzhoy, Sanjeev Khanna 
Polynomial flowcut gaps and hardness of directed cut problems. 
J. ACM 
2009 
DBLP DOI BibTeX RDF 
Directed multicut, hardness of approximation, sparsest cut 
37  Julia Chuzhoy, Sanjeev Khanna 
Polynomial flowcut gaps and hardness of directed cut problems. 
STOC 
2007 
DBLP DOI BibTeX RDF 
concurrent flow, directed multicut, directed sparsest cut, flowcut gaps, hardness of approximation, multicommodity flow 
36  Camil Demetrescu, Giuseppe F. Italiano 
Fully Dynamic Transitive Closure: Breaking Through the O(n2) Barrier. 
FOCS 
2000 
DBLP DOI BibTeX RDF 
fully dynamic transitive closure, unit worstcase cost, amortized time, singleoperation 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 
36  Frédéric Rousseau, J. M. Bergé, Michel Israël 
Hardware/Software Partitioning for Telecommunications Systems. 
COMPSAC 
1996 
DBLP DOI BibTeX RDF 
echo suppression, dataflow systems, list scheduling algorithm, force calculation, acoustic echo canceller, scheduling, realtime 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 
36  Guy Even, Joseph Naor, Satish Rao, Baruch Schieber 
DivideandConquer Approximation Algorithms via Spreading Metrics (Extended Abstract). 
FOCS 
1995 
DBLP DOI BibTeX RDF 
divideandconquer approximation algorithms, spreading metrics, NPhard graph optimization problems, graph optimization problems, fractional spreading metric, fractional lengths, optimisation problem, spreading metric, interval graph completion, storagetime product, computational complexity, optimisation, directed graphs, directed graphs, polynomial time, vertices, divide and conquer methods, multicuts, polynomial time approximation algorithm 
36  Thomas L. Casavant, Jon G. Kuhl 
A Communicating Finite Automata Approach to Modeling Distributed Computation and Its Application to Distributed DecisionMaking. 
IEEE Trans. Computers 
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 decisionmaking 
36  Joseph Naor, Roy Schwartz 
The directed circular arrangement problem. 
SODA 
2004 
DBLP BibTeX RDF 

36  Herman J. Haverkort, Laura Toma 
I/OEfficient Algorithms on NearPlanar Graphs. 
LATIN 
2006 
DBLP DOI BibTeX RDF 

36  Uri Zwick 
All Pairs Shortest Paths in Weighted Directed Graphs ¾ Exact and Almost Exact Algorithms. 
FOCS 
1998 
DBLP DOI BibTeX RDF 
Bridging sets, Randomized algorithms, Shortest paths, Matrix multiplication 
35  Mamadou Moustapha Kanté, Michaël Rao 
Directed RankWidth and Displit Decomposition. 
WG 
2009 
DBLP DOI BibTeX RDF 

35  Martin Hülse 
Generating Complex Connectivity Structures for LargeScale Neural Models. 
ICANN (2) 
2008 
DBLP DOI BibTeX RDF 

35  Guy Kortsarz, Zeev Nutov 
Approximation algorithm for knode connected subgraphs via critical graphs. 
STOC 
2004 
DBLP DOI BibTeX RDF 

35  Georg Gottlob, Phokion G. Kolaitis, Thomas Schwentick 
Existential secondorder logic over graphs: Charting the tractability frontier. 
J. ACM 
2004 
DBLP DOI BibTeX RDF 
Existential secondorder logic, graph constraints, prefix classes, graph coloring, NPcomplete problems, finite model theory 
34  Chandra Chekuri, Martin Pál 
A Recursive Greedy Algorithm for Walks in Directed Graphs. 
FOCS 
2005 
DBLP DOI BibTeX RDF 

33  Samir Khuller, Barna Saha 
On Finding Dense Subgraphs. 
ICALP (1) 
2009 
DBLP DOI BibTeX RDF 

32  Adrian Kosowski, Alfredo Navarra, Maria Cristina Pinotti 
Synchronization Helps Robots to Detect Black Holes in Directed Graphs. 
OPODIS 
2009 
DBLP DOI BibTeX RDF 

32  Amos Beimel, Anat Paskin 
On Linear Secret Sharing for Connectivity in Directed Graphs. 
SCN 
2008 
DBLP DOI BibTeX RDF 

32  Telikepalli Kavitha, Kurt Mehlhorn 
Algorithms to Compute Minimum Cycle Basis in Directed Graphs. 
Theory Comput. Syst. 
2007 
DBLP DOI BibTeX RDF 

32  Mohammad R. Salavatipour, Jacques Verstraëte 
Disjoint Cycles: Integrality Gap, Hardness, and Approximation. 
IPCO 
2005 
DBLP DOI BibTeX RDF 

32  Andreas Björklund, Thore Husfeldt, Sanjeev Khanna 
Approximating Longest Directed Paths and Cycles. 
ICALP 
2004 
DBLP DOI BibTeX RDF 

32  Stavros G. Kolliopoulos, Clifford Stein 
Improved Approximation Algorithms for Unsplittable Flow Problems. 
FOCS 
1997 
DBLP DOI BibTeX RDF 

31  Viswanath Nagarajan, R. Ravi 0001 
The Directed Minimum Latency Problem. 
APPROXRANDOM 
2008 
DBLP DOI BibTeX RDF 

31  Bruno Bachelet, Philippe Mahey 
Minimum convex piecewise linear cost tension problem on quasik seriesparallel graphs. 
4OR 
2004 
DBLP DOI BibTeX RDF 
Minimum cost tension, twoterminal seriesparallel digraph, seriesparallel recognition, outofkilter algorithm, graph decomposition 
31  Yonghong Chen, Xing Liu, Vaithianathan Mani Venkatasubramanian 
Fast Algorithms for Detecting Circular VAR Flows in Large PowerFlow Models. 
HICSS 
2008 
DBLP DOI BibTeX RDF 
Loop flows, powerflow studies, Directed graphs, depthfirst search, electric power system 
31  Till Tantau 
A Logspace Approximation Scheme for the Shortest Path Problem for Graphs with Bounded Independence Number. 
STACS 
2004 
DBLP DOI BibTeX RDF 

30  Martin Harrigan, Patrick Healy 
Efficiently drawing a significant spanning tree of a directed graph. 
APVIS 
2007 
DBLP DOI BibTeX RDF 

30  Joseph Cheriyan, John H. Reif 
Directed st Bumberings, Rubber Bands, and Testing Digraph kVertex Connectivity. 
SODA 
1992 
DBLP BibTeX RDF 

30  Réka Albert, Bhaskar DasGupta, Riccardo Dondi, Eduardo D. Sontag 
Inferring (Biological) Signal Transduction Networks via Transitive Reductions of Directed Graphs. 
Algorithmica 
2008 
DBLP DOI BibTeX RDF 
Transitive reduction of directed graphs, Minimum equivalent digraph, (Biological) signal transduction networks, Approximation algorithms 
30  Alex R. Berg, Tibor Jordán 
Minimally kEdgeConnected Directed Graphs of Maximal Size. 
Graphs and Combinatorics 
2005 
DBLP DOI BibTeX RDF 
Minimally kedgeconnected, Directed graphs, Edgeconnectivity 
30  Noga Alon, Asaf Shapira 
Testing subgraphs in directed graphs. 
STOC 
2003 
DBLP DOI BibTeX RDF 
directed graphs, property testing, regularity lemma 
30  Baruch Awerbuch, Yuval Shavitt 
Topology aggregation for directed graphs. 
IEEE/ACM Trans. Netw. 
2001 
DBLP DOI BibTeX RDF 
graph theory, asynchronous transfer mode, topology, directed graphs, widearea networks, communication system routing, PNNI 
30  Michael A. Bender, Donna K. Slonim 
The Power of Team Exploration: Two Robots Can Learn Unlabeled Directed Graphs 
FOCS 
1994 
DBLP DOI BibTeX RDF 
randomwalk algorithm, team exploration, unlabeled directed graphs, homing sequence, stronglyconnected directed graph, random walks, teacher, cooperating robots 
30  Makoto Imase, Masaki Itoh 
A Design for Directed Graphs with Minimum Diameter. 
IEEE Trans. Computers 
1983 
DBLP DOI BibTeX RDF 
diameter minimization, optimum solution, Computer networks, directed graphs, switching systems 
29  Ward Douglas Maurer 
Removing backward goto statements from Ada programs: possibilities and problems. 
SIGAda 
2008 
DBLP DOI BibTeX RDF 
ada compilers, goto statements, loop trees, directed graphs 
29  Jeffrey Johns, Sridhar Mahadevan 
Constructing basis functions from directed graphs for value function approximation. 
ICML 
2007 
DBLP DOI BibTeX RDF 

29  Michael E. Saks, Alex Samorodnitsky, Leonid Zosin 
A Lower Bound On The Integrality Gap For Minimum Multicut In Directed Networks. 
Combinatorica 
2004 
DBLP DOI BibTeX RDF 
Mathematics Subject Classification (2000): 05C20, 90C35, 90B10 
29  Edith Hemaspaandra, Holger Spakowski, Mayur Thakur 
Complexity of Cycle Length Modularity Problems in Graphs. 
LATIN 
2004 
DBLP DOI BibTeX RDF 

28  Jeong Han Kim 
The Poisson Cloning Model for Random Graphs, Random Directed Graphs and Random kSAT Problems. 
COCOON 
2004 
DBLP DOI BibTeX RDF 

28  Eldar Fischer, Oded Lachish, Ilan Newman, Arie Matsliah, Orly Yahalom 
On the Query Complexity of Testing Orientations for Being Eulerian. 
APPROXRANDOM 
2008 
DBLP DOI BibTeX RDF 

28  Dongsheng Duan, Yuhua Li, Yanan Jin, Zhengding Lu 
Community mining on dynamic weighted directed graphs. 
CIKMCNIKM 
2009 
DBLP DOI BibTeX RDF 
changepoint detection, dynamic weighted directed graph, modularity, compactness, community discovery 
28  Markus Bläser, Bodo Manthey 
Approximating Maximum Weight Cycle Covers in Directed Graphs with Weights Zero and One. 
Algorithmica 
2005 
DBLP DOI BibTeX RDF 
Approximation algorithms, Combinatorial optimization, Traveling salesman problem, Inapproximability, Cycle covers 
28  Telikepalli Kavitha, Kurt Mehlhorn 
A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs. 
STACS 
2005 
DBLP DOI BibTeX RDF 

28  Liam Roditty, Uri Zwick 
Replacement Paths and k Simple Shortest Paths in Unweighted Directed Graphs. 
ICALP 
2005 
DBLP DOI BibTeX RDF 

28  Raphael Yuster, Uri Zwick 
Answering distance queries in directed graphs using fast matrix multiplication. 
FOCS 
2005 
DBLP DOI BibTeX RDF 

28  Liran Carmel, David Harel, Yehuda Koren 
Combining Hierarchy and Energy Drawing Directed Graphs. 
IEEE Trans. Vis. Comput. Graph. 
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][ >>] 
