The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for Digraph with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1969-1978 (16) 1979-1982 (18) 1983-1987 (21) 1988-1990 (23) 1991-1992 (16) 1993-1994 (18) 1995 (17) 1996-1997 (23) 1998-1999 (30) 2000 (21) 2001 (22) 2002 (33) 2003 (27) 2004 (35) 2005 (28) 2006 (42) 2007 (38) 2008 (57) 2009 (50) 2010 (22) 2011 (19) 2012 (23) 2013 (23) 2014-2015 (34) 2016 (30) 2017 (28) 2018 (23) 2019 (23) 2020 (27) 2021 (28) 2022 (36) 2023 (33) 2024 (9)
Publication types (Num. hits)
article(525) data(1) incollection(4) inproceedings(358) phdthesis(5)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 399 occurrences of 272 keywords

Results
Found 893 publication records. Showing 893 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
99Ding-Zhu Du, Yuh-Dauh Lyuu, D. Frank Hsu Line Digraph Iterations and Spread Concept - with Application to Graph Theory, Fault Tolerance, and Routing. Search on Bibsonomy WG The full citation details ... 1991 DBLP  DOI  BibTeX  RDF line digraph iteration, diameter vulnerability, k-diameter, fault tolerance, graph, connectivity, container, de Bruijn graph, spread, Kautz graph
80Geir Agnarsson, Ágúst S. Egilsson, Magnús M. Halldórsson Proper Down-Coloring Simple Acyclic Digraphs. Search on Bibsonomy AGTIVE The full citation details ... 2003 DBLP  DOI  BibTeX  RDF multidimensional clustering, acyclic digraph, ancestor, descendant, down-set, Relational databases, indexing, hypergraph, poset, digraph, vertex coloring, bitmap indexing
69Yosuke Kikuchi, Shingo Osawa, Yukio Shibata Broadcasting in Generalized de Bruijn Digraphs. Search on Bibsonomy COCOON The full citation details ... 2002 DBLP  DOI  BibTeX  RDF generalized de Bruijn digraph, Imase Itoh digraph, k-ramified tree, broadcasting, Kronecker product
64Walter Didimo Computing Upward Planar Drawings Using Switch-Regularity Heuristics. Search on Bibsonomy SOFSEM The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
64Toru Hasunuma Laying Out Iterated Line Digraphs Using Queues. Search on Bibsonomy GD The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
61Boting Yang, Yi Cao Monotonicity of strong searching on digraphs. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Cops-and-robber game, Pursuit-and-evasion problem, NP-complete, Monotonicity, Graph searching, Digraph
59Boting Yang, Yi Cao Digraph Strong Searching: Monotonicity and Complexity. Search on Bibsonomy AAIM The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
54Stephan Kreutzer, Sebastian Ordyniak Digraph Decompositions and Monotonicity in Digraph Searching. Search on Bibsonomy WG The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
53Deli Zhao, Zhouchen Lin, Xiaoou Tang Contextual Distance for Data Perception. Search on Bibsonomy ICCV The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
51Miguel Angel Fiol, J. Luis A. Yebra, Ignacio Alegre de Miquel Line Digraph Iterations and the (d, k) Digraph Problem. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 1984 DBLP  DOI  BibTeX  RDF (d, k) graph problem, line digraph, Moore bound, routing algorithm, Communication network
48Nicola Pio Belfiore, Umberto Berti, Aldo Mondino, Matteo Verotti A Comprehensive Evaluation of the Efficiency of an Integrated Biogas, Trigen, PV and Greenhouse Plant, Using Digraph Theory. Search on Bibsonomy Towards Intelligent Engineering and Information Technology The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
48Zhibo Ren, Qiang Zhang, Xiujuan Ma Efficiently Mining Maximal Frequent Itemsets Based on Digraph. Search on Bibsonomy FSKD (2) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
48Genjiu Xu, Xueliang Li 0001, Shenggui Zhang The Binding Number of a Digraph. Search on Bibsonomy CJCDGCGT The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Binding number, Caccetta-Häggkvist Conjecture, directed graph, girth
48Ling Chen 0005, Li Tu, Hongjian Chen A Novel Ant Clustering Algorithm with Digraph. Search on Bibsonomy ICNC (2) The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
48Hsun-Wen Chang, Pei-Fang Tsai Characterizing the reconstruction and enumerating the patterns of DNA sequences with repeats. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF DNA digraph, Reduced digraph, Pattern graph, Combinatorial enumeration, Catalan number, Repeat, DNA sequencing
46Xiao Ming Zhou, Chuan-Heng Ang, Tok Wang Ling Dynamic interactive spatial similarity retrieval in iconic image databases using enhanced digraph. Search on Bibsonomy SAC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF enhanced digraph, iconic image databases, interactive, spatial relationship, similarity retrieval
46Peter Borm, René van den Brink, Marco Slikker An Iterative Procedure for Evaluating Digraph Competitions. Search on Bibsonomy Ann. Oper. Res. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF digraph competitions, limit measure, relational power measure, stochastic processes, cooperative games, Shapley value
46Sukhamay Kundu An O(V) algorithm M for computing transitive reduction of a planar acyclic digraph. Search on Bibsonomy ACM Southeast Regional Conference The full citation details ... 1982 DBLP  DOI  BibTeX  RDF planar digraph, transitive reduction, algorithm, depth-first search
43Tamara Mchedlidze, Antonios Symvonis Crossing-Free Acyclic Hamiltonian Path Completion for Planar st-Digraphs. Search on Bibsonomy ISAAC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
43Mathias Weller, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann On Making Directed Graphs Transitive. Search on Bibsonomy WADS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
43Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh 0001 Better Algorithms and Bounds for Directed Maximum Leaf Problems. Search on Bibsonomy FSTTCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
43Aleksander Malnic, Dragan Marusic, Norbert Seifter, Boris Zgrablic Highly Arc-Transitive Digraphs With No Homomorphism Onto Z. Search on Bibsonomy Comb. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF AMS Subject Classification (2000) Classes: 05C25, 05C20
40Arvind Gupta, Pavol Hell, Mehdi Karimi 0001, Arash Rafiey Minimum Cost Homomorphisms to Reflexive Digraphs. Search on Bibsonomy LATIN The full citation details ... 2008 DBLP  DOI  BibTeX  RDF minimum cost homomorphism, reflexive digraph, NP-completeness, polynomial time algorithm, homomorphism, dichotomy
38Ikno Kim, Junzo Watada A Biologically Intelligent Encoding Approach to a Hierarchical Classification of Relational Elements in a Digraph. Search on Bibsonomy KES (2) The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
38Nadja Betzler, Johannes Uhlmann Parameterized Complexity of Candidate Control in Elections and Related Digraph Problems. Search on Bibsonomy COCOA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
38Jin-Myung Won, Fakhreddine Karray A Genetic Algorithm with cycle representation and contraction digraph model for Guideway Network design of Personal Rapid Transit. Search on Bibsonomy IEEE Congress on Evolutionary Computation The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
38Peter Mahlmann, Christian Schindelhauer Distributed random digraph transformations for peer-to-peer networks. Search on Bibsonomy SPAA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF distributed algorithms, peer-to-peer networks, random graphs, expander graphs
38Albert Atserias On Digraph Coloring Problems and Treewidth Duality. Search on Bibsonomy LICS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
38Ventsi G. Rumchev Positive Linear Systems Reachability Criterion in Digraph Form. Search on Bibsonomy POSTA The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
38András Frank, Tibor Jordán How to Make a Strongly Connected Digraph Two-Connected. Search on Bibsonomy IPCO The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
38V. V. Dixit EDNA: Expert Digraph Network Analysis. Search on Bibsonomy IEA/AIE (Vol. 1) The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
35Michael Lampis, Georgia Kaouri, Valia Mitsou On the Algorithmic Effectiveness of Digraph Decompositions and Complexity Measures. Search on Bibsonomy ISAAC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Digraph decompositions, Treewidth, Parameterized Complexity
35Carles Padró, Paz Morillo, Miguel Angel Fiol Comments on "Line Digraph Iterations and Connectivity Analysis of de Bruijn and Kautz Graphs". Search on Bibsonomy IEEE Trans. Computers The full citation details ... 1996 DBLP  DOI  BibTeX  RDF diameter-vulnerability, line digraph iteration, fault-tolerance, Connectivity, spread
35Ding-Zhu Du, Yuh-Dauh Lyuu, D. Frank Hsu Line Digraph Iterations and Connectivity Analysis of de Bruijn and Kautz Graphs. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 1993 DBLP  DOI  BibTeX  RDF de Bruijn digraphs, digraph iterations, connectivity analysis, optimal general theorem, optimal bounds, length-bound disjoint paths, graph theory, iterative methods, directed graphs, node-disjoint paths, Kautz graphs
35Miguel Angel Fiol, Anna S. Lladó The Partial Line Digraph Technique in the Design of Large Interconnection Networks. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 1992 DBLP  DOI  BibTeX  RDF partial line digraph technique, large interconnection networks, maximum out-degree, Kautz digraphs, distributed systems, design, routing, connectivity, multiprocessor interconnection networks, directed graphs, expandability
33Marcel Jackson, Tomasz Kowalski, Todd Niven Digraph related constructions and the complexity of digraph homomorphism problems Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
33Huiping Cai, Juan Liu 0001, Jixiang Meng Domination number in iterated line digraph of a complete bipartite digraph. Search on Bibsonomy Ars Comb. The full citation details ... 2012 DBLP  BibTeX  RDF
33Stephan Kreutzer, Sebastian Ordyniak Digraph decompositions and monotonicity in digraph searching. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
33Yuuki Tanaka, Yukio Shibata The Cayley digraph associated to the Kautz digraph. Search on Bibsonomy Ars Comb. The full citation details ... 2010 DBLP  BibTeX  RDF
33Linda Marshall, Derrick G. Kourie Deriving a digraph isomorphism for digraph compliance measurement. Search on Bibsonomy SAICSIT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
33Juan Liu 0001, Lin Sun, Jixiang Meng A line digraph of a complete bipartite digraph. Search on Bibsonomy Appl. Math. Lett. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
33Stephan Kreutzer, Sebastian Ordyniak Digraph Decompositions and Monotonicity in Digraph Searching Search on Bibsonomy CoRR The full citation details ... 2008 DBLP  BibTeX  RDF
33Simone Severini On the structure of the adjacency matrix of the line digraph of a regular digraph. Search on Bibsonomy Discret. Appl. Math. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
33Camino Balbuena, Daniela Ferrero, Xavier Marcote, Ignacio M. Pelayo Algebraic properties of a digraph and its line digraph. Search on Bibsonomy J. Interconnect. Networks The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
33Fuji Zhang, Guoning Lin When a digraph and its line digraph are connected and cospectral. Search on Bibsonomy Discret. Math. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
33Doug Mahar, Renee Napier, Michael Wagner 0004, William Laverty, Ron Henderson, Michael Hiron Optimizing digraph-latency based biometric typist verification systems: inter and intra typist differences in digraph latency distributions. Search on Bibsonomy Int. J. Hum. Comput. Stud. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
33Masatosi Imori, Makoto Matsumoto, Hisao Yamada The line digraph of a regular and pancircular digraph is also regular and pancircular. Search on Bibsonomy Graphs Comb. The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
32Paul Balister, Stefanie Gerke, Gregory Z. Gutin Convex Sets in Acyclic Digraphs. Search on Bibsonomy Order The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Acyclic diagraphs, Convex sets
32Arnab Bhattacharyya 0001, Elena Grigorescu, Kyomin Jung, Sofya Raskhodnikova, David P. Woodruff Transitive-closure spanners. Search on Bibsonomy SODA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
32Tamara Mchedlidze, Antonios Symvonis Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings. Search on Bibsonomy WALCOM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
32Tamara Mchedlidze, Antonios Symvonis Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs. Search on Bibsonomy COCOON The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
32Daniel Lokshtanov, Venkatesh Raman 0001, Saket Saurabh 0001, Somnath Sikdar On the Directed Degree-Preserving Spanning Tree Problem. Search on Bibsonomy IWPEC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
32Raymond Bisdorff, Patrick Meyer, Marc Roubens R UBIS : a bipolar-valued outranking method for the choice problem. Search on Bibsonomy 4OR The full citation details ... 2008 DBLP  DOI  BibTeX  RDF MSC Classification (2000) 05C20, 90B50
32Bhavani Shankar, Prasant Gopal, Kannan Srinathan, C. Pandu Rangan Unconditionally reliable message transmission in directed networks. Search on Bibsonomy SODA The full citation details ... 2008 DBLP  BibTeX  RDF
32Aimal Rextin, Patrick Healy A Fully Dynamic Algorithm to Test the Upward Planarity of Single-Source Embedded Digraphs. Search on Bibsonomy GD The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
32Francesco Giordano, Giuseppe Liotta, Tamara Mchedlidze, Antonios Symvonis Computing Upward Topological Book Embeddings of Upward Planar Digraphs. Search on Bibsonomy ISAAC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
32Daniela Ferrero Some properties of superline digraphs. Search on Bibsonomy ITNG The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
32Farshad Rum, Brandon W. Gordon, Mohammad Eghtesad Consensus in Noisy Switching Directed Networks with Time-Delays. Search on Bibsonomy ICNSC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
32Yangjun Chen, Donovan Cooke On the transitive closure representation and adjustable compression. Search on Bibsonomy SAC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF databases, directed acyclic graphs, transitive closures, graph decomposition, branchings, topological order
32Saverio Caminiti, Rossella Petreschi String Coding of Trees with Locality and Heritability. Search on Bibsonomy COCOON The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
32Weizhen Gu, Xingde Jia On a Traffic Control Problem. Search on Bibsonomy ISPAN The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
32Abraham Flaxman, Alan M. Frieze The Diameter of Randomly Perturbed Digraphs and Some Applications.. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
32Carlos E. R. Alves, Edson Cáceres, Amaury Antônio de Castro Jr., Siang W. Song, Jayme Luiz Szwarcfiter Efficient Parallel Implementation of Transitive Closure of Digraphs. Search on Bibsonomy PVM/MPI The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
32Robert E. Jamison Transforming Toric Digraphs. Search on Bibsonomy AGTIVE The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
32Sven Hartmann Orthogonal Decompositions of Complete Digraphs. Search on Bibsonomy Graphs Comb. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
32Gregory Z. Gutin, Anders Yeo Solution of a Conjecture of Volkmann on the Number of Vertices in Longest Paths and Cycles of Strong Semicomplete Multipartite Digraphs. Search on Bibsonomy Graphs Comb. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
32Romeo Rizzi Excluding a Simple Good Pair Approach to Directed Cuts. Search on Bibsonomy Graphs Comb. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
32Bertrand Guenin Circuit Mengerian Directed Graphs. Search on Bibsonomy IPCO The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
32Sounaka Mishra, Kripasindhu Sikdar On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem. Search on Bibsonomy IFIP TCS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF NP-optimization problems, Minimaximal and maximinimal NP-optimization problems, L-reduction, Approximation algorithms, Hardness of approximation, APX-hardness
32Claus-Peter Schnorr, C. R. Subramanian 0001 Almost Optimal (on the average) Combinatorial Algorithms for Boolean Matrix Product Witnesses, Computing the Diameter (Extended Abstract). Search on Bibsonomy RANDOM The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
32Erich Prisner Bicliques in Graphs II: Recognizing k-Path Graphs and Underlying Graphs of Line Digraphs. Search on Bibsonomy WG The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
32Hermann Stamm On Feedback Problems in Planar Digraphs. Search on Bibsonomy WG The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
32F. Evans, Jan Jantzen A Structured Approach to Analysis and Design of Complex Systems. Search on Bibsonomy APL The full citation details ... 1990 DBLP  DOI  BibTeX  RDF APL
32Ewald Speckenmeyer On Feedback Problems in Diagraphs. Search on Bibsonomy WG The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
32Jan Jantzen Inference Planning Using Digraphs and Boolean Arrays. Search on Bibsonomy APL The full citation details ... 1989 DBLP  DOI  BibTeX  RDF APL
29Boting Yang, Yi Cao Standard directed search strategies and their applications. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Oriented grids, Pursuit-evasion problem, Digraph, Directed search
29Ré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
29Deqiang Chen, Jie Zheng, Xiaoqian Wu Computer Simulation and Word-Updating Dynamical Systems (WDS) on Digraphs. Search on Bibsonomy ICIC (2) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Word-updating Dynamical System (WDS), S-pseud Independent Set, Functional Digraph
29Wei Meng, Shengjia Li Semicomplete Multipartite Digraphs Whose Every Arc Is Contained in a Hamiltonian Path. Search on Bibsonomy International Conference on Computational Science (3) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Semicomplete multipartite digraph, Semi-partition complete digraphs, Hamiltonian paths
29Mao-cheng Cai, Xiaotie Deng, Lusheng Wang 0001 Minimum k Arborescences with Bandwidth Constraints. Search on Bibsonomy Algorithmica The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Arborescence, Polymatroid intersection, Algorithm and complexity, Maximum flow, Matroid, Digraph, Polymatroid
29Appu Muthusamy On Resolvable Multipartite G-Designs. Search on Bibsonomy Graphs Comb. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Cycle-factorization, Wreath product of graphs, Complete symmetric k-partite multi-digraph, Resesolvable multipartite G-design
29Miika Silfverberg, I. Scott MacKenzie, Panu Korhonen Predicting text entry speed on mobile phones. Search on Bibsonomy CHI The full citation details ... 2000 DBLP  DOI  BibTeX  RDF digraph frequencies, mobile phones, text entry, Fitts' law, mobile systems, human performance modeling, keypad input
29Daniela Ferrero, Carles Padró Fault-Tolerant Routings in Large Generalized Cycles. Search on Bibsonomy SCCC The full citation details ... 1997 DBLP  DOI  BibTeX  RDF fault-tolerant routing algorithms, de Bruijn generalized cycles, Kautz generalized cycles, generalized p-cycle, vertex set partitioning, faulty elements, directed graphs, diameter, digraph, ordered set, path length
29Hannah Honghua Yang, D. F. Wong 0001 New algorithms for min-cut replication in partitioned circuits. Search on Bibsonomy ICCAD The full citation details ... 1995 DBLP  DOI  BibTeX  RDF Hyper-MAMC, VLSI circuit partitioning, k-way partition, k-way partitioned digraph, min-cut replication, partitioned circuits, VLSI, optimal algorithm, circuit layout CAD, hypergraphs, VLSI layout, digraphs, circuit layout
29Ernst W. Mayr Scheduling interval orders in parallel. Search on Bibsonomy HICSS (2) The full citation details ... 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
27Hermann Gruber, Markus Holzer 0001 Finite Automata, Digraph Connectivity, and Regular Expression Size. Search on Bibsonomy ICALP (2) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
27Gregory Z. Gutin, Adrian Johnstone, Joseph Reddington, Elizabeth Scott, Anders Yeo An Algorithm for Finding Input-Output Constrained Convex Sets in an Acyclic Digraph. Search on Bibsonomy WG The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
27Jud Leonard, Avi Purkayastha, Matt Reilly, Tushar Mohan The software interface for a cluster interconnect based on the Kautz digraph. Search on Bibsonomy CLUSTER The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
27János Barát Directed Path-width and Monotonicity in Digraph Searching. Search on Bibsonomy Graphs Comb. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Search games, Path-width, Cops-and-robber games, Directed graph, Monotonicity
27E. M. Kelly, Lisa M. Bartlett Application of the Digraph Method in System Fault Diagnostics. Search on Bibsonomy ARES The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Fault Diagnosis, Availability, Failure Detection, Digraphs
27Rudolf Müller, Andreas S. Schulz The Interval Order Polytope of a Digraph. Search on Bibsonomy IPCO The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
27Klaus Simon, Davide Crippa, Fabian Collenberg On the Distribution of the Transitive Closure in a Random Acyclic Digraph. Search on Bibsonomy ESA The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
27Paola Bertolazzi, Robert F. Cohen, Giuseppe Di Battista, Roberto Tamassia, Ioannis G. Tollis How to Draw a Series-Parallel Digraph (Extended Abstract). Search on Bibsonomy SWAT The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
27Paul G. Spirakis, Athanasios K. Tsakalidis A Very Fast, Practical Algorithm for Finding a Negative Cycle in a Digraph. Search on Bibsonomy ICALP The full citation details ... 1986 DBLP  DOI  BibTeX  RDF
21Sarmad Abbasi, Patrick Healy, Aimal Rextin An Improved Upward Planarity Testing Algorithm and Related Applications. Search on Bibsonomy WALCOM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
21Marc Christie, Fabrice Lamarche, Frédéric Benhamou A Spatio-temporal Reasoning System for Virtual Camera Planning. Search on Bibsonomy Smart Graphics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
21Prasad Chebolu, Alan M. Frieze, Páll Melsted, Gregory B. Sorkin Average-Case Analyses of Vickrey Costs. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF VCG auction, Random Assignment Problem, shortest path, minimum spanning tree, random graph, Average-case analysis, MST
21Nathann Cohen, Fedor V. Fomin, Gregory Z. Gutin, Eun Jung Kim 0002, Saket Saurabh 0001, Anders Yeo Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem. Search on Bibsonomy COCOON The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
21Sergey Kitaev, Steve Seif Word Problem of the Perkins Semigroup via Directed Acyclic Graphs. Search on Bibsonomy Order The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Perkins semigroup, Free semigroup, Computational complexity -, Directed acyclic graph, Poset, Partially order set, Word problem
21Satoru Iwata 0001, Takuro Matsuda Finding coherent cyclic orders in strong digraphs. Search on Bibsonomy Comb. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 05C20, 90C27
Displaying result #1 - #100 of 893 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license