Search results for "graphs"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
7	Krishnam Raju Jampani, Anna Lubiw	The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs.	WADS	2009	DBLP DOI BibTeX RDF	Simultaneous graphs, Sandwich graphs, Comparability graphs, Chordal graphs, Permutation graphs
7	Philippe Gambette, Stéphane Vialette	On Restrictions of Balanced 2-Interval Graphs.	WG	2007	DBLP DOI BibTeX RDF	2-interval graphs, graph classes, quasi-line graphs, circular interval graphs, scheduling, bioinformatics, line graphs, claw-free graphs
6	MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Dániel Marx	Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth.	STOC	2010	DBLP DOI BibTeX RDF	Steiner forest, bounded-genus graphs, bounded-treewidth graphs, planar graphs, PTAS, series-parallel graphs
6	L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan	On the Cubicity of AT-Free Graphs and Circular-Arc Graphs.	Graph Theory, Computational Intelligence and Thought	2009	DBLP DOI BibTeX RDF	Cubicity, AT-free graphs, cocomparability graphs, bandwidth, circular-arc graphs, intersection graphs
6	Tom Høholdt, Heeralal Janwa	Optimal Bipartite Ramanujan Graphs from Balanced Incomplete Block Designs: Their Characterizations and Applications to Expander/LDPC Codes.	AAECC	2009	DBLP DOI BibTeX RDF	eigenvalues of graphs, finite geometries, LDPC and expander codes, Bipartite graphs, expander graphs, Ramanujan graphs, BIBD
6	Andreas Brandstädt, Van Bang Le	Simplicial Powers of Graphs.	COCOA	2008	DBLP DOI BibTeX RDF	simplicial powers, forbidden induced subgraph characterization, block graphs, ptolemaic graphs, strongly chordal graphs, chordal graphs, leaf powers, Graph powers
6	Stavros D. Nikolopoulos, Leonidas Palios	Recognizing HHDS-Free Graphs.	WG	2005	DBLP DOI BibTeX RDF	HHD-free graphs, HHDS-free graphs, homogeneously orderable graphs, recognition, sun, perfectly orderable graphs
6	Guillaume Fertin, André Raspaud	Families of Graphs Having Broadcasting and Gossiping Properties.	WG	1998	DBLP DOI BibTeX RDF	minimum broadcast graphs, minimum gossip graphs, Knödel graphs, Broadcasting, hypercubes, gossiping, circulant graphs
6	Peter F. Corbett	Rotator Graphs: An Efficient Topology for Point-to-Point Multiprocessor Networks.	IEEE Trans. Parallel Distrib. Syst.	1992	DBLP DOI BibTeX RDF	point-to-point multiprocessor networks, directed permutation graphs, Faber-Moore graphs, rotator graphs, one-step fault diagnosable, fault tolerant, topology, multiprocessor interconnection networks, directed graphs, Hamiltonian circuit, optimal routing algorithm
5	Frank Gurski, Egon Wanke	On Module-Composed Graphs.	WG	2009	DBLP DOI BibTeX RDF	special graph classes, homogeneous sets, HHDS-free graphs, bipartite graphs, distance hereditary graphs
5	Kyriaki Ioannidou, Stavros D. Nikolopoulos	Colinear Coloring on Graphs.	WALCOM	2009	DBLP DOI BibTeX RDF	Colinear coloring, threshold graphs, quasi-threshold graphs, algorithms, complexity, chordal graphs, chromatic number
5	Balasubramanian Sivan, S. Harini, C. Pandu Rangan	Core and Conditional Core Path of Specified Length in Special Classes of Graphs.	WALCOM	2009	DBLP DOI BibTeX RDF	Core path, Conditional core path, Bipartite permutation graphs, Threshold graphs, Proper Interval graphs
5	Andreas Brandstädt, Martin Charles Golumbic, Van Bang Le, Marina Lipshteyn	Path-Bicolorable Graphs.	Graph Theory, Computational Intelligence and Thought	2009	DBLP DOI BibTeX RDF	P 3-bicolorable graphs, P 4-bicolorable graphs, linear time recognition, bipartite graphs
5	Guillermo Durán, Min Chih Lin, Sergio Mera, Jayme Luiz Szwarcfiter	Algorithms for finding clique-transversals of graphs.	Annals OR	2008	DBLP DOI BibTeX RDF	Clique-transversals, Helly circular-arc graphs, free circular-arc graphs, Algorithms, Circular-arc graphs
5	Günter Westphal, Christoph von der Malsburg, Rolf P. Würtz	Feature-Driven Emergence of Model Graphs for Object Recognition and Categorization.	Applied Pattern Recognition	2008	DBLP DOI BibTeX RDF	model graphs, parquet graphs, position-invariant feature detectors, infomax principle, preselection network, model candidates, emergence of model graphs, feature- vs. correspondence-based object recognition, compositionality, elastic graph matching
5	Andreas Brandstädt, Christian Hundt	Ptolemaic Graphs and Interval Graphs Are Leaf Powers.	LATIN	2008	DBLP DOI BibTeX RDF	and Classification Leaf powers, leaf roots, strongly chordal graphs, ptolemaic graphs, graph class inclusions, (unit) interval graphs, clique-width, graph powers
5	Ryuhei Uehara	Bandwidth of Bipartite Permutation Graphs.	ISAAC	2008	DBLP DOI BibTeX RDF	bipartite permutation graphs, chain graphs, threshold graphs, Bandwidth, interval graphs
5	Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter	Proper Helly Circular-Arc Graphs.	WG	2007	DBLP DOI BibTeX RDF	Helly circular-arc graphs, proper circular-arc graphs, unit circular-arc graphs, algorithms, forbidden subgraphs
5	Tiziana Calamoneri, Saverio Caminiti, Stephan Olariu, Rossella Petreschi	On the L(h, k)-Labeling of Co-comparability Graphs.	ESCAPE	2007	DBLP DOI BibTeX RDF	L(h and k)-Labeling, co-comparability graphs, unit-interval graphs, interval graphs
5	Alain Bretto, Luc Gillibert	G-graphs for the cage problem: a new upper bound.	ISSAC	2007	DBLP DOI BibTeX RDF	G-graphs, cage graphs, graphs from group
5	Herbert Fleischner, Stefan Szeider	On Edge-Colored Graphs Covered by Properly Colored Cycles.	Graphs and Combinatorics	2005	DBLP DOI BibTeX RDF	Properly colored cycles, 1-Extendable graphs, Cycle covers, Edge-colored graphs
5	Alain Bretto, Luc Gillibert, Bernard Laget	Symmetric and semisymmetric graphs construction using G-graphs.	ISSAC	2005	DBLP DOI BibTeX RDF	G-graphs, graphs from group, semisymmetric graph, symmetric graphs
5	Iztok Peterin	Characterizing Flag Graphs and Induced Subgraphs of Cartesian Product Graphs.	Order	2004	DBLP DOI BibTeX RDF	flag graphs, induced subgraphs, edge-labellings, Cartesian product graphs, quotient graphs
5	Yonatan Bilu, Nathan Linial	Constructing Expander Graphs by 2-Lifts and Discrepancy vs. Spectral Gap.	FOCS	2004	DBLP DOI BibTeX RDF	Lifts of Graphs, Signed Graphs, Expander Graphs, Discrepancy, Lifts
5	Hans L. Bodlaender	Necessary Edges in k-Chordalisations of Graphs.	J. Comb. Optim.	2003	DBLP DOI BibTeX RDF	triangulated graphs, graph algorithms, interval graphs, treewidth, chordal graphs, pathwidth
5	Daniel Kobler, Udi Rotics	Finding Maximum Induced Matchings in Subclasses of Claw-Free and P 5-Free Graphs, and in Graphs with Matching and Induced Matching of Equal Maximum Size.	Algorithmica	2003	DBLP DOI BibTeX RDF	Induced matching, Bull, Polynomial algorithms, Regular graphs, Line-graphs, Claw-free graphs
5	Mary Mehrnoosh Eshaghian, Ying-Chieh Wu	Mapping heterogeneous task graphs onto heterogeneous system graphs.	Heterogeneous Computing Workshop	1997	DBLP DOI BibTeX RDF	heterogeneous task graphs mapping, heterogeneous system graphs, heterogeneous task graphs, multilayer clustered graph, Spec graph, Rep graph, suboptimal matching, computational complexity
5	Paola Alimonti, Tiziana Calamoneri	Improved Approximations of Independent Dominating Set in Bounded Degree Graphs.	WG	1996	DBLP DOI BibTeX RDF	Minimum Independent Dominating Set, Approximation Algorithms, Local Search, Greedy, Regular Graphs, Cubic Graphs, Bounded Degree Graphs
5	Stefan Felsner, Rudolf Müller, Lorenz Wernisch	Trapezoid Graphs and Generalizations, Geometry and Algorithms.	SWAT	1994	DBLP DOI BibTeX RDF	trapezoid graphs, circle graphs, Algorithms, partially ordered sets, circular-arc graphs, order dimension
5	Philip N. Klein, Sairam Subramanian	A linear-processor polylog-time algorithm for shortest paths in planar graphs	FOCS	1993	DBLP DOI BibTeX RDF	linear-processor polylog-time algorithm, directed planar graphs, bounded-genus graphs, 2-dimensional overlap graphs, shortest paths, planar graphs, separators, decomposition tree
4	Hilit Achiezra, Konstantin Golenberg, Benny Kimelfeld, Yehoshua Sagiv	Exploratory keyword search on data graphs.	SIGMOD Conference	2010	DBLP DOI BibTeX RDF	information retrieval on graphs, keyword search on graphs, redundancy elimination
4	Noga Alon, Shai Gutner	Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs.	Algorithmica	2009	DBLP DOI BibTeX RDF	H-minor-free graphs, Degenerated graphs, Dominating set problem, Finding an induced cycle, Fixed-parameter tractable algorithms
4	Eyal Ackerman	On the Maximum Number of Edges in Topological Graphs with no Four Pairwise Crossing Edges.	Discrete & Computational Geometry	2009	DBLP DOI BibTeX RDF	Discharging method, Quasi-planar graphs, Geometric graphs, Topological graphs
4	Denis Xavier Charles, Kristin E. Lauter, Eyal Z. Goren	Cryptographic Hash Functions from Expander Graphs.	J. Cryptology	2009	DBLP DOI BibTeX RDF	Supersingular elliptic curves, Elliptic curve cryptography, Expander graphs, Cryptographic hash functions, Ramanujan graphs, Isogenies
4	Eyal Ackerman, Jacob Fox, János Pach, Andrew Suk	On grids in topological graphs.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	tur?n-type problems, grids, geometric graphs, topological graphs
4	Shai Gutner	Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor.	IWPEC	2009	DBLP DOI BibTeX RDF	H-minor-free graphs, degenerated graphs, dominating set problem, fixed-parameter tractable algorithms, problem kernel
4	Toshiki Saitoh, Katsuhisa Yamanaka, Masashi Kiyomi, Ryuhei Uehara	Random Generation and Enumeration of Proper Interval Graphs.	WALCOM	2009	DBLP DOI BibTeX RDF	proper interval graphs, unit interval graphs, enumeration, Counting, random generation
4	Andrea Francke, Michael Hoffmann	The Euclidean degree-4 minimum spanning tree problem is NP-hard.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	degree-constricted graphs, degree-restricted graphs, np-complete, reduction, spanning trees, geometric optimization, geometric graphs, bounded-degree graphs
4	Jiong Guo, Rolf Niedermeier, Daniel Raible	Improved Algorithms and Complexity Results for Power Domination in Graphs.	Algorithmica	2008	DBLP DOI BibTeX RDF	Graphs of bounded treewidth, (Power) domination in graphs, Computational complexity, Graph algorithms, Parameterized complexity, Design and analysis of algorithms, Fixed-parameter algorithms
4	Ryuhei Uehara	Simple Geometrical Intersection Graphs.	WALCOM	2008	DBLP DOI BibTeX RDF	grid intersection graphs, graph isomorphism, interval graphs, Hamiltonian path problem
4	Andreas Brandstädt, Tilo Klembt, Vadim V. Lozin, Raffaele Mosca	Independent Sets of Maximum Weight in Apple-Free Graphs.	ISAAC	2008	DBLP DOI BibTeX RDF	clique separators, apple-free graphs, polynomial-time algorithm, Maximum independent set, modular decomposition, claw-free graphs
4	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
4	Navid Imani, Hamid Sarbazi-Azad, Selim G. Akl	Resource Placement in Networks Using Chromatic Sets of Power Graphs.	CSR	2007	DBLP DOI BibTeX RDF	Symmetric graphs, Power graphs, Interconnection networks, Chromatic number, Resource placement
4	Stavros D. Nikolopoulos, Leonidas Palios	An O ( nm )-Time Certifying Algorithm for Recognizing HHD-Free Graphs.	FAW	2007	DBLP DOI BibTeX RDF	HHD-free graphs, certifying algorithms, recognition, perfectly orderable graphs
4	Noga Alon, Amin Coja-Oghlan, Hiêp Hàn, Mihyun Kang, Vojtech Rödl, Mathias Schacht	Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions.	ICALP	2007	DBLP DOI BibTeX RDF	quasi-random graphs, Laplacian eigenvalues, Grothendieck’s inequality, regularity lemma, sparse graphs
4	Piotr Indyk, Anastasios Sidiropoulos	Probabilistic embeddings of bounded genus graphs into planar graphs.	Symposium on Computational Geometry	2007	DBLP DOI BibTeX RDF	bounded genus graphs, probabilistic approximation, embeddings, planar graphs
4	Jurek Czyzowicz, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Jorge Urrutia	Local Edge Colouring of Yao-Like Subgraphs of Unit Disk Graphs.	SIROCCO	2007	DBLP DOI BibTeX RDF	Edge Colouring, Wedge, Wireless Network, Location Awareness, Local Algorithm, Unit Disk Graphs, Geometric Graphs
4	Noga Alon, Shai Gutner	Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs.	COCOON	2007	DBLP DOI BibTeX RDF	H-minor-free graphs, degenerated graphs, dominating set problem, finding an induced cycle, fixed-parameter tractable algorithms
4	Andreas Jakoby, Till Tantau	Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs.	FSTTCS	2007	DBLP DOI BibTeX RDF	logspace algorithms, distance problem, longest path problem, bounded tree-width, K 4-minor-free graphs, Series-parallel graphs
4	Bruno Escoffier, Laurent Gourvès, Jérôme Monnot	Complexity and Approximation Results for the Connected Vertex Cover Problem.	WG	2007	DBLP DOI BibTeX RDF	Connected vertex cover, APX-complete, approximation algorithm, planar graphs, bipartite graphs, chordal graphs
4	Elkin Vumar	On the Circumference of 3-Connected Quasi-Claw-Free Graphs.	Graphs and Combinatorics	2006	DBLP DOI BibTeX RDF	Circumference, Quasi-claw-free graphs, Claw-free graphs
4	Harold N. Gabow	Using expander graphs to find vertex connectivity.	J. ACM	2006	DBLP DOI BibTeX RDF	graphs, Expander graphs, vertex connectivity
4	Rodrigo S. C. Leão, Valmir C. Barbosa	Minimal Chordal Sense of Direction and Circulant Graphs.	MFCS	2006	DBLP DOI BibTeX RDF	Chordal sense of direction, Cayley graphs, Circulant graphs
4	Min Chih Lin, Jayme Luiz Szwarcfiter	Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs.	COCOON	2006	DBLP DOI BibTeX RDF	Helly circular-arc graphs, algorithms, forbidden subgraphs, circular-arc graphs
4	Sriram V. Pemmaraju, Imran A. Pirwani	Energy conservation via domatic partitions.	MobiHoc	2006	DBLP DOI BibTeX RDF	domatic partition, growth-bounded graphs, distributed algorithms, metric space, dominating sets, unit disk graphs, maximal independent sets, network decomposition, doubling dimension, unit ball graphs
4	Zhi-Zhong Chen, Mitsuharu Kouno	A Linear-Time Algorithm for 7-Coloring 1-Plane Graphs.	Algorithmica	2005	DBLP DOI BibTeX RDF	Plane embeddings, Plane embeddings, NP-completeness, Graph algorithms, Planar graphs, Planar graphs, Vertex coloring
4	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
4	Cartic Ramakrishnan, William H. Milnor, Matthew Perry, Amit P. Sheth	Discovering informative connection subgraphs in multi-relational graphs.	SIGKDD Explorations	2005	DBLP DOI BibTeX RDF	multi-relational graphs, semantic pattern discovery in RDF graphs, subgraph discovery
4	Sriram V. Pemmaraju, Sriram Penumatcha, Rajiv Raman	Approximating interval coloring and max-coloring in chordal graphs.	ACM Journal of Experimental Algorithmics	2005	DBLP DOI BibTeX RDF	Graph coloring, chordal graphs, dynamic storage allocation, perfect graphs
4	Peter Mahlmann, Christian Schindelhauer	Peer-to-peer networks based on random transformations of connected regular undirected graphs.	SPAA	2005	DBLP DOI BibTeX RDF	distributed algorithms, peer-to-peer networks, random graphs, expander graphs
4	Stavros D. Nikolopoulos, Leonidas Palios	Maximum-Size Subgraphs of P4-Sparse Graphs Admitting a Perfect Matching.	Panhellenic Conference on Informatics	2005	DBLP DOI BibTeX RDF	P4-sparse graphs, maximum-size subgraphs, perfect matching, maximum matchings, Perfect graphs, cographs
4	Daniel Gonçalves	Edge partition of planar sraphs into two outerplanar graphs.	STOC	2005	DBLP DOI BibTeX RDF	edge partition, planar graphs, outerplanar graphs
4	Luigi P. Cordella, Pasquale Foggia, Carlo Sansone, Mario Vento	A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs.	IEEE Trans. Pattern Anal. Mach. Intell.	2004	DBLP DOI BibTeX RDF	Graph-subgraph isomorphism, attributed relational graphs, large graphs
4	Odile Favaron, Michael A. Henning	Paired-Domination in Claw-Free Cubic Graphs.	Graphs and Combinatorics	2004	DBLP DOI BibTeX RDF	Claw-Free cubic graphs, Paired-domination, Bounds
4	Garth Isaak	Sum List Coloring Block Graphs.	Graphs and Combinatorics	2004	DBLP DOI BibTeX RDF	Sum coloring, Block graphs, List coloring
4	Stavros D. Nikolopoulos, Charis Papadopoulos	The Number of Spanning Trees in K n-Complements of Quasi-Threshold Graphs.	Graphs and Combinatorics	2004	DBLP DOI BibTeX RDF	Complement spanning-tree matrix theorem, Quasi-threshold graphs, Networks, Trees, Spanning trees, Combinatorial problems
4	Igor E. Zverovich	A Characterization of Domination Reducible Graphs.	Graphs and Combinatorics	2004	DBLP DOI BibTeX RDF	Domination number, Hereditary class of graphs, Forbidden induced subgraph, Homogeneous set
4	Monia Discepoli, Ivan Gerace, Riccardo Mariani, Andrea Remigi	A Spectral Technique to Solve the Chromatic Number Problem in Circulant Graphs.	ICCSA	2004	DBLP DOI BibTeX RDF	Spectral Properties of Graphs, Approximation Algorithms, Graph Coloring, Chromatic Number, Circulant Graphs
4	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
4	Alexandr V. Kostochka, Vladimir A. Tashkinov	Decomposing Graphs into Long Paths.	Order	2003	DBLP DOI BibTeX RDF	edge-decompositions of graphs, 2-edge-connected graphs
4	Paolo Boldi, Sebastiano Vigna	Lower bounds for sense of direction in regular graphs.	Distributed Computing	2003	DBLP DOI BibTeX RDF	sense of direction, Distributed computing, random graphs, regular graphs
4	Cyril Gavoille, Christophe Paul	Optimal Distance Labeling for Interval and Circular-Arc Graphs.	ESA	2003	DBLP DOI BibTeX RDF	distance queries, Data-structure, interval graphs, labeling scheme, circular-arc graphs
4	Satoru Watanabe, Satoshi Okawa	An Extended Star Graph: A Proposal of a New Network Topology and Its Fundamental Properties.	ISPA	2003	DBLP DOI BibTeX RDF	degree four Cayley graphs, hy- percubes, routing algorithm, diameter, Cayley graphs, star graphs
4	Peter Kuchment, Leonid A. Kunyansky	Differential Operators on Graphs and Photonic Crystals.	Adv. Comput. Math.	2002	DBLP DOI BibTeX RDF	photonic bandgap, photonic crystal, Dirichlet-to-Neumann map, differential operators on graphs, pseudo-differential operators on graphs, spectrum
4	Alain Cournier	Search in Indecomposable Graphs.	WG	2002	DBLP DOI BibTeX RDF	Indecomposable Graphs, Search in a Graph, Prime Graphs
4	Ryuhei Uehara	Linear Time Algorithms on Chordal Bipartite and Strongly Chordal Graphs.	ICALP	2002	DBLP DOI BibTeX RDF	Chordal bipartite graphs, lexicographic breadth first search, vertex elimination ordering, strongly chordal graphs, design and analysis of algorithms
4	Tiziana Calamoneri, Rossella Petreschi	L(2, 1)-labeling of planar graphs.	DIAL-M	2001	DBLP DOI BibTeX RDF	L(2, 1)-labeling, planar graphs, outerplanar graphs, multi-hop radio networks
4	Cornelis Hoede, L. Zhang	Word Graphs: The Third Set.	ICCS	2001	DBLP DOI BibTeX RDF	Knowledge graphs, logic word, ontology. skip AMS Subject Classifications: 05C99, 68F99, classification, word graphs
4	Andreas Brandstädt	On Robust Algorithms for the Maximum Weight Stable Set Problem.	FCT	2001	DBLP DOI BibTeX RDF	Maximum Weight Stable Set Problem on graphs, modules and homogeneous sets in graphs, graph structure, clique width, robust algorithms, prime graphs
4	Georg Gottlob, Phokion G. Kolaitis, Thomas Schwentick	Existential Second-Order Logic over Graphs: Charting the Tractability Frontier.	FOCS	2000	DBLP DOI BibTeX RDF	existential second-order logic, existential second-order formula, prefix class, first-order quantifiers, polynomial-time solvable problem, computational complexity, computational complexity, graph theory, graphs, directed graphs, NP-complete problems, formal logic, undirected graphs, descriptive complexity, tractability
4	Andrea Corradini, Fabio Gadducci	An Algebraic Presentation of Term Graphs, via GS-Monoidal Categories.	Applied Categorical Structures	1999	DBLP DOI BibTeX RDF	term graphs, symmetric monoidal categories, gs-monoidal categories, directed acyclic graphs, algebraic theories
4	Chi-Hsiang Yeh, Emmanouel A. Varvarigos	Macro-Star Networks: Efficient Low-Degree Alternatives to Star Graphs.	IEEE Trans. Parallel Distrib. Syst.	1998	DBLP DOI BibTeX RDF	algorithm emulation, multinode broadcast, routing, Interconnection networks, parallel architectures, Cayley graphs, star graphs, total exchange
4	Cornelis Hoede, X. Liu	Word Graphs: The Second Set.	ICCS	1998	DBLP DOI BibTeX RDF	Knowledge graphs, adverbs, AMS Subject Classifications: 05C99, 68F99, classifiers, adjectives, word graphs
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	Laurenz Wiskott, Jean-Marc Fellous, Norbert Krüger, Christoph von der Malsburg	Face Recognition by Elastic Bunch Graph Matching.	ICIP	1997	DBLP DOI BibTeX RDF	elastic bunch graph matching, labeled graphs, elastic graph matching process, phase information, node positioning, object-adapted graphs, image graph extraction, sample image graphs, data structure, face recognition, face recognition, rotations, similarity function, human faces, Gabor wavelet transform
4	Toshinori Yamada, Shuichi Ueno	Fault-Tolerant Graphs for Tori.	ISPAN	1996	DBLP DOI BibTeX RDF	Matric Graphs, Edge-Fault-Tolerant Graphs, Dimension-Fault-Tolerant Graphs, Error-Correcting Linear Codes, Tori
4	Nabil Kahale	Eigenvalues and Expansion of Regular Graphs.	J. ACM	1995	DBLP DOI BibTeX RDF	induced subgraphs, selection networks, load balancing, random walks, eigenvalues, expander graphs, Ramanujan graphs
4	Monika Rauch Henzinger, Thomas A. Henzinger, Peter W. Kopke	Computing Simulations on Finite and Infinite Graphs.	FOCS	1995	DBLP DOI BibTeX RDF	simulations computing, infinite graphs, finite graphs, labeled graphs, reactive systems verification, O(mn) algorithm, symbolic similarity-checking procedure, 2D rectangular automata, continuous environments, model-checking problem, graph theory, decidability, decidability, automata theory, similarity relations
4	Javier Campos, José Manuel Colom, Hauke Jungnitz, Manuel Silva	Approximate Throughput Computation of Stochastic Marked Graphs.	IEEE Trans. Software Eng.	1994	DBLP DOI BibTeX RDF	approximate throughput computation, stochastic marked graphs, stochastic strongly connected marked graphs, net decomposition, single input-single output cut, qualitative behavior, general decomposition technique, iterative response time approximation method, intractable systems, stochastic Petri net models, performance evaluation, Petri nets, error, stochastic processes, state space, iterative technique
4	Monika Rauch Henzinger	Fully Dynamic Cycle-Equivalence in Graphs	FOCS	1994	DBLP DOI BibTeX RDF	cycle-equivalence, cycle-equivalence problem, query time, data structure, graphs, planar graphs, optimizing compilers, control-flow graph, undirected graph, plane graphs
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)
4	Claude Boksenbaum, Boris Carbonneill, Ollivier Haemmerlé, Thérèse Libourel	Conceptual Graphs for Relational Databases.	ICCS	1993	DBLP DOI BibTeX RDF	Database, Conceptual graphs
4	Jacob Katzenelson, Shlomit S. Pinter, Eugen Schenfeld	Type Matching, Type-Graphs, and the Schanuel Conjecture.	ACM Trans. Program. Lang. Syst.	1992	DBLP DOI BibTeX RDF	Schanuel conjecture, graph hashing, mapping graphs to numbers, type matching, compilers, types, type-graphs
4	Alain Cournier, Michel Habib	An Efficient Algorithm to Recognize Prime Undirected Graphs.	WG	1992	DBLP DOI BibTeX RDF	substitution decomposition, autonomous subsets, modules, Undirected graphs, prime graphs
4	Edward A. Lee	Consistency in Dataflow Graphs.	IEEE Trans. Parallel Distrib. Syst.	1991	DBLP DOI BibTeX RDF	synchronous dataflow graphs, dataflow graphsemantics, token-flow model, graphtheory, programming languages, deadlock, programming theory, consistency checks, dataflow graphs, dataflow graph
4	Nabil Kahale	Better Expansion for Ramanujan Graphs	FOCS	1991	DBLP DOI BibTeX RDF	expansion properties, explicit k-regular graphs, random walks, eigenvalue, expanders, regular graphs, Ramanujan graphs
4	Mayez A. Al-Mouhamed	Lower Bound on the Number of Processors and Time for Scheduling Precedence Graphs with Communication Costs.	IEEE Trans. Software Eng.	1990	DBLP DOI BibTeX RDF	precedence graphs, earliest starting time, task delay, finish time, minimum time increase, interprocessor communication links, optimum performance, small graphs, scheduling, scheduling, graph theory, lower bounds, communication costs, task graph, completion time, time interval
4	Jai Prakash Gupta, Stephen C. Winter, Derek R. Wilson	CTDNet-A Mechanism for the Concurrent Execution of Lambda Graphs.	IEEE Trans. Software Eng.	1989	DBLP DOI BibTeX RDF	CTDNet, lambda graphs, data-driven reduction machine, applicative functional programs, lambda calculus expressions, binary-tree-structured process graphs, ancestor, master processes, slave processes, distributed eager evaluation scheme, conditional expressions, distributed string reduction, parallel programmingas, graph theory, children, parallel machines, pointers, concurrent execution, neighbors
4	Chao-Chih Yang, Jennifer Jau-Yin Chen, H. Lewis Chau	Algorithms for Constructing Minimal Deduction Graphs.	IEEE Trans. Software Eng.	1989	DBLP DOI BibTeX RDF	MDG construction algorithms, Hern clauses, minimal deduction graphs, Horn clause logic, DG, Horn formulas, positive literals, rule instances, tree space, logic programming, graphs, expert systems, inference mechanisms, transitivity, backtracking, inference rules, reflexivity, arcs, sink, subtrees, HF
4	Manfred Kaul	Specification of Error Distances for Graphs by Precedence Graph Grammars and Fast Recognition of Similarity.	WG	1986	DBLP DOI BibTeX RDF	Additional Key Words and Phrases inexact graph matching, similarity of graphs, error distance between graphs, graph parser, parallel parsing, hierarchical graph model, graph grammar, precedence relations