Search results for "directed graphs"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
4	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 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
4	Emden R. Gansner, Eleftherios Koutsofios, Stephen C. North, Kiem-Phong Vo	A Technique for Drawing Directed Graphs.	IEEE Trans. Software Eng.	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)
3	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
3	Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Harald Räcke, Tom Leighton	Oblivious routing on node-capacitated and directed graphs.	ACM Transactions on Algorithms	2007	DBLP DOI BibTeX RDF	node-capacitated graphs, directed graphs, communication networks, Oblivious routing
3	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
3	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
3	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
3	Joseph Naor, Baruch Schieber	Improved Approximations for Shallow-Light Spanning Trees.	FOCS	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
3	Rasool Jalili, Frans A. Henskens	Using directed graphs to describe entity dependency in stable distributed persistent stores.	HICSS	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
3	Olivier Déforges, Dominique Barba	Segmentation of Complex Documents Multilevel Images: A Robust and Fast Text Bodies-Headers Detection and Extraction Scheme 770. (PDF / PS)	ICDAR	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
2	Zhilin Wu, Stéphane Grumbach	Feasibility of Motion Planning on Directed Graphs.	TAMC	2009	DBLP DOI BibTeX RDF
2	Adrian Kosowski, Alfredo Navarra, Maria Cristina Pinotti	Synchronization Helps Robots to Detect Black Holes in Directed Graphs.	OPODIS	2009	DBLP DOI BibTeX RDF
2	Erich Grädel, Lukasz Kaiser, Roman Rabinovich	Directed Graphs of Entanglement Two.	FCT	2009	DBLP DOI BibTeX RDF
2	Dongsheng Duan, Yuhua Li, Yanan Jin, Zhengding Lu	Community mining on dynamic weighted directed graphs.	CIKM-CNIKM	2009	DBLP DOI BibTeX RDF	change-point detection, dynamic weighted directed graph, modularity, compactness, community discovery
2	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
2	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
2	Alejandro Estrella-Balderrama, Fabrizio Frati, Stephen G. Kobourov	Upward Straight-Line Embeddings of Directed Graphs into Point Sets.	WG	2008	DBLP DOI BibTeX RDF
2	Yuval Emek, David Peleg, Liam Roditty	A near-linear time algorithm for computing replacement paths in planar directed graphs.	SODA	2008	DBLP BibTeX RDF
2	Amos Beimel, Anat Paskin	On Linear Secret Sharing for Connectivity in Directed Graphs.	SCN	2008	DBLP DOI BibTeX RDF
2	Christian Bachmaier, Franz-Josef Brandenburg, Wolfgang Brunner, Gergö Lovász	Cyclic Leveling of Directed Graphs.	Graph Drawing	2008	DBLP DOI BibTeX RDF
2	Ward Douglas Maurer	Removing backward go-to statements from Ada programs: possibilities and problems.	SIGAda	2008	DBLP DOI BibTeX RDF	ada compilers, go-to statements, loop trees, directed graphs
2	Yonghong Chen, Xing Liu, Vaithianathan Venkatasubramanian	Fast Algorithms for Detecting Circular VAR Flows in Large Power-Flow Models.	HICSS	2008	DBLP DOI BibTeX RDF	Loop flows, power-flow studies, Directed graphs, depth-first search, electric power system
2	Telikepalli Kavitha, Kurt Mehlhorn	Algorithms to Compute Minimum Cycle Basis in Directed Graphs.	Theory Comput. Syst.	2007	DBLP DOI BibTeX RDF
2	Reid Andersen, Fan R. K. Chung, Kevin J. Lang	Local Partitioning for Directed Graphs Using PageRank.	WAW	2007	DBLP DOI BibTeX RDF
2	Jeffrey Johns, Sridhar Mahadevan	Constructing basis functions from directed graphs for value function approximation.	ICML	2007	DBLP DOI BibTeX RDF
2	Dietmar Berwanger, David Janin	Automata on Directed Graphs: Edge Versus Vertex Marking.	ICGT	2006	DBLP DOI BibTeX RDF
2	Steven Butler	Relating singular values and discrepancy of weighted directed graphs.	SODA	2006	DBLP DOI BibTeX RDF
2	Jan Obdrzálek	DAG-width: connectivity measure for directed graphs.	SODA	2006	DBLP DOI BibTeX RDF
2	James Arvo, Kevin Novins	Fluid sketching of directed graphs.	AUIC	2006	DBLP DOI BibTeX RDF	eager recognition, fluid sketching, human-computer interaction, graph drawing, pen-based interface, sketch-based interaction
2	Julia Chuzhoy, Sanjeev Khanna	Hardness of cut problems in directed graphs.	STOC	2006	DBLP DOI BibTeX RDF	directed multicut, hardness of approximation, sparsest cut
2	Victor S. Lempitsky, Yuri Boykov, Denis V. Ivanov	Oriented Visibility for Multiview Reconstruction.	ECCV	2006	DBLP DOI BibTeX RDF	multiview reconstruction, dense stereo, CW-complex, global optimization, directed graphs, visibility, graph cuts, image-based modeling
2	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
2	Alex R. Berg, Tibor Jordán	Minimally k-Edge-Connected Directed Graphs of Maximal Size.	Graphs and Combinatorics	2005	DBLP DOI BibTeX RDF	Minimally k-edge-connected, Directed graphs, Edge-connectivity
2	Donald Bamber, I. R. Goodman, Hung T. Nguyen	Robust reasoning with rules that have exceptions: From second-order probability to argumentation via upper envelopes of probability and possibility plus directed graphs.	Ann. Math. Artif. Intell.	2005	DBLP DOI BibTeX RDF	AMS subject classification 68T37, 03B38, 60G57, 05C20
2	Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tom Leighton, Harald Räcke	Oblivious routing on node-capacitated and directed graphs.	SODA	2005	DBLP BibTeX RDF
2	Liam Roditty, Uri Zwick	Replacement Paths and k Simple Shortest Paths in Unweighted Directed Graphs.	ICALP	2005	DBLP DOI BibTeX RDF
2	Telikepalli Kavitha, Kurt Mehlhorn	A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs.	STACS	2005	DBLP DOI BibTeX RDF
2	Giampaolo L. Libralao, Telma Woerle de Lima, Karen Honda, Alexandre C. B. Delbem	Node-depth encoding for directed graphs.	Congress on Evolutionary Computation	2005	DBLP DOI BibTeX RDF
2	Chandra Chekuri, Martin Pál	A Recursive Greedy Algorithm for Walks in Directed Graphs.	FOCS	2005	DBLP DOI BibTeX RDF
2	Raphael Yuster, Uri Zwick	Answering distance queries in directed graphs using fast matrix multiplication.	FOCS	2005	DBLP DOI BibTeX RDF
2	Seok-Hee Hong, Nikola S. Nikolov	Hierarchical Layouts of Directed Graphs in Three Dimensions.	Graph Drawing	2005	DBLP DOI BibTeX RDF
2	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
2	Dietmar Berwanger, Erich Grädel	Entanglement - A Measure for the Complexity of Directed Graphs with Applications to Logic and Games.	LPAR	2004	DBLP DOI BibTeX RDF
2	M. Fatih Demirci, Ali Shokoufandeh, Sven J. Dickinson, Yakov Keselman, Lars Bretzner	Many-to-Many Feature Matching Using Spherical Coding of Directed Graphs.	ECCV	2004	DBLP DOI BibTeX RDF
2	Jeong Han Kim	The Poisson Cloning Model for Random Graphs, Random Directed Graphs and Random k-SAT Problems.	COCOON	2004	DBLP DOI BibTeX RDF
2	Ravi Kapadia	SymCure: A Model-Based Approach for Fault Management with Causal Directed Graphs.	IEA/AIE	2003	DBLP DOI BibTeX RDF
2	Noga Alon, Asaf Shapira	Testing subgraphs in directed graphs.	STOC	2003	DBLP DOI BibTeX RDF	directed graphs, property testing, regularity lemma
2	Lars Arge, Laura Toma, Norbert Zeh	I/O-efficient topological sorting of planar DAGs.	SPAA	2003	DBLP DOI BibTeX RDF	I/O-efficient algorithms, planar directed graphs, graph algorithms, topological sorting, ear decomposition
2	Zaobin Gan, Chuanbo Chen, Xiandeng Pei	A Requirements Description Model Based on Conditional Directed Graphs.	ICFEM	2002	DBLP DOI BibTeX RDF
2	Liam Roditty, Mikkel Thorup, Uri Zwick	Roundtrip spanners and roundtrip routing in directed graphs.	SODA	2002	DBLP BibTeX RDF
2	Jop F. Sibeyn, James Abello, Ulrich Meyer	Heuristics for semi-external depth first search on directed graphs.	SPAA	2002	DBLP DOI BibTeX RDF	strong components, graph algorithms, depth first search, external memory
2	Liran Carmel, David Harel, Yehuda Koren	Drawing Directed Graphs Using One-Dimensional Optimization.	Graph Drawing	2002	DBLP DOI BibTeX RDF
2	Geraldo Pereira de Souza, Gerson Henrique Pfitscher	An Implementation of a Distributed Algorithm for Detection of Local Knots and Cycles in Directed Graphs Based on the CSP Model and Java.	DS-RT	2002	DBLP DOI BibTeX RDF
2	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, wide-area networks, communication system routing, PNNI
2	Ulrich Meyer	Single-source shortest-paths on arbitrary directed graphs in linear average-case time.	SODA	2001	DBLP BibTeX RDF
2	Michael A. Bender, Dana Ron	Testing Acyclicity of Directed Graphs in Sublinear Time.	ICALP	2000	DBLP DOI BibTeX RDF
2	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 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
2	Richard C. Holt, Andreas Winter, Andy Schürr	GXL: Toward a Standard Exchange Format. (PDF / PS)	WCRE	2000	DBLP DOI BibTeX RDF	software exchange format, typed attributed directed graphs, XML, tool interoperability
2	Daniele Frigioni, Tobias Miller, Umberto Nanni, Giulio Pasqualone, Guido Schäfer, Christos D. Zaroliagis	An Experimental Study of Dynamic Algorithms for Directed Graphs.	ESA	1998	DBLP DOI BibTeX RDF
2	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
2	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, 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
2	Guy Even, Joseph Naor, Baruch Schieber, Madhu Sudan	Approximating Minimum Feedback Sets and Multi-Cuts in Directed Graphs.	IPCO	1995	DBLP DOI BibTeX RDF
2	Guy Even, Joseph Naor, Satish Rao, Baruch Schieber	Divide-and-Conquer Approximation Algorithms via Spreading Metrics (Extended Abstract).	FOCS	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
2	Paolo Giulio Franciosa, Giorgio Gambosi, Umberto Nanni	On the Structure of DFS-Forests on Directed Graphs and the Dynamic Maintenance of DFS on DAG's.	ESA	1994	DBLP DOI BibTeX RDF
2	Michael A. Bender, Donna K. Slonim	The Power of Team Exploration: Two Robots Can Learn Unlabeled Directed Graphs	FOCS	1994	DBLP DOI BibTeX RDF	random-walk algorithm, team exploration, unlabeled directed graphs, homing sequence, strongly-connected directed graph, random walks, teacher, cooperating robots
2	Thomas L. Casavant, Jon G. Kuhl	A Communicating Finite Automata Approach to Modeling Distributed Computation and Its Application to Distributed Decision-Making.	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 decision-making
2	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
2	Alfs T. Berztiss	A Backtrack Procedure for Isomorphism of Directed Graphs.	J. ACM	1973	DBLP DOI BibTeX RDF
1	Youhua Chen	loop: An R package for performing decomposition of weighted directed graphs, food web analysis and flexible network plotting.	Ecological Informatics	2013	DBLP DOI BibTeX RDF
1	Johanna Björklund, Lars-Daniel Öhman	Simulation relations for pattern matching in directed graphs.	Theor. Comput. Sci.	2013	DBLP DOI BibTeX RDF
1	Wai Hong Chan, Wai Chee Shiu, Pak Kiu Sun, Xuding Zhu	The strong game colouring number of directed graphs.	Discrete Mathematics	2013	DBLP DOI BibTeX RDF
1	András Frank, Satoru Fujishige, Naoyuki Kamiyama, Naoki Katoh	Independent arborescences in directed graphs.	Discrete Mathematics	2013	DBLP DOI BibTeX RDF
1	Gunnar Brinkmann	Generating regular directed graphs.	Discrete Mathematics	2013	DBLP DOI BibTeX RDF
1	B. Petelin, Igor Kononenko, V. Malacic, Matjaz Kukar	Multi-level association rules and directed graphs for spatial data analysis.	Expert Syst. Appl.	2013	DBLP DOI BibTeX RDF
1	Christos Giatsidis, Dimitrios M. Thilikos, Michalis Vazirgiannis	D-cores: measuring collaboration of directed graphs based on degeneracy.	Knowl. Inf. Syst.	2013	DBLP DOI BibTeX RDF
1	Alejandro D. Domínguez-García, Christoforos N. Hadjicostis	Distributed Matrix Scaling and Application to Average Consensus in Directed Graphs.	IEEE Trans. Automat. Contr.	2013	DBLP DOI BibTeX RDF
1	Angelia Nedic, Alexander Olshevsky	Distributed optimization over time-varying directed graphs	CoRR	2013	DBLP BibTeX RDF
1	Rajesh Hemant Chitnis, Fedor V. Fomin, Petr A. Golovach	Parameterized Complexity of the Anchored k-Core Problem for Directed Graphs	CoRR	2013	DBLP BibTeX RDF
1	Adrien Richard, Paul Ruet	From kernels in directed graphs to fixed points and negative cycles in Boolean networks.	Discrete Applied Mathematics	2013	DBLP DOI BibTeX RDF
1	Keith J. Edwards	Harmonious chromatic number of directed graphs.	Discrete Applied Mathematics	2013	DBLP DOI BibTeX RDF
1	Yonah Cherniavsky, Avraham Goldstein, Vadim E. Levit	Balanced Abelian group valued functions on directed graphs: Extended abstract.	CTW	2013	DBLP BibTeX RDF
1	Dietmar Berwanger, Anuj Dawar, Paul Hunter, Stephan Kreutzer, Jan Obdrzálek	The dag-width of directed graphs.	J. Comb. Theory, Ser. B	2012	DBLP DOI BibTeX RDF
1	Robert Gray, Dugald Macpherson, Cheryl E. Praeger, Gordon F. Royle	Set-homogeneous directed graphs.	J. Comb. Theory, Ser. B	2012	DBLP DOI BibTeX RDF
1	Donatella Granata, Behnam Behdani, Panos M. Pardalos	On the complexity of path problems in properly colored directed graphs.	J. Comb. Optim.	2012	DBLP DOI BibTeX RDF
1	Malgorzata Sulkowska	The best choice problem for upward directed graphs.	Discrete Optimization	2012	DBLP DOI BibTeX RDF
1	Dietmar Berwanger, Erich Grädel, Lukasz Kaiser, Roman Rabinovich	Entanglement and the complexity of directed graphs.	Theor. Comput. Sci.	2012	DBLP DOI BibTeX RDF
1	Rafael Amer, José Miguel Giménez, Antonio Magaña	Accessibility measures to nodes of directed graphs using solutions for generalized cooperative games.	Math. Meth. of OR	2012	DBLP DOI BibTeX RDF
1	Daniela Kühn, Deryk Osthus	A survey on Hamilton cycles in directed graphs.	Eur. J. Comb.	2012	DBLP DOI BibTeX RDF
1	Mamadou Moustapha Kanté	Well-quasi-ordering of matrices under Schur complement and applications to directed graphs.	Eur. J. Comb.	2012	DBLP DOI BibTeX RDF
1	Liam Roditty, Uri Zwick	Replacement paths and k simple shortest paths in unweighted directed graphs.	ACM Transactions on Algorithms	2012	DBLP DOI BibTeX RDF
1	Zhongmou Li, Hui Xiong, Yanchi Liu	Mining blackhole and volcano patterns in directed graphs: a general approach.	Data Min. Knowl. Discov.	2012	DBLP DOI BibTeX RDF
1	Péter L. Erdös, Claude Tardif, Gábor Tardos	On infinite-finite duality pairs of directed graphs	CoRR	2012	DBLP BibTeX RDF
1	Lewis Tseng, Nitin H. Vaidya	Exact Byzantine Consensus in Directed Graphs	CoRR	2012	DBLP BibTeX RDF
1	Nitin H. Vaidya, Lewis Tseng, Guanfeng Liang	Iterative Approximate Byzantine Consensus in Arbitrary Directed Graphs - Part II: Synchronous and Asynchronous Systems	CoRR	2012	DBLP BibTeX RDF
1	Richard Southwell, Jianwei Huang, Biying Shou	Congestion Games on Weighted Directed Graphs, with Applications to Spectrum Sharing	CoRR	2012	DBLP BibTeX RDF
1	Felix Canavoi, Erich Grädel, Roman Rabinovich	The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs	GandALF	2012	DBLP DOI BibTeX RDF
1	Nitin H. Vaidya, Lewis Tseng, Guanfeng Liang	Iterative Approximate Byzantine Consensus in Arbitrary Directed Graphs	CoRR	2012	DBLP BibTeX RDF
1	Nitin H. Vaidya	Matrix Representation of Iterative Approximate Byzantine Consensus in Directed Graphs	CoRR	2012	DBLP BibTeX RDF
1	Kaveh Khoshkhah, Hossein Soltani, Manouchehr Zaker	Dynamic monopolies in directed graphs: the spread of unilateral influence in social networks	CoRR	2012	DBLP BibTeX RDF
1	Bahman Gharesifard, Jorge Cortes	Continuous-time distributed convex optimization on directed graphs	CoRR	2012	DBLP BibTeX RDF