Search results for "Graphs"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
18	Julia Böttcher	Coloring Sparse Random k-Colorable Graphs in Polynomial Expected Time.	MFCS	2005	DBLP DOI BibTeX RDF
18	Arnaud Carayol, Antoine Meyer	Linearly Bounded Infinite Graphs.	MFCS	2005	DBLP DOI BibTeX RDF
18	Karianto Wong	Adding Monotonic Counters to Automata and Transition Graphs.	Developments in Language Theory	2005	DBLP DOI BibTeX RDF
18	Lars Schoolmann	Triadic Concept Graphs and Their Conceptual Contents.	ICFCA	2005	DBLP DOI BibTeX RDF
18	Michael T. Goodrich, George S. Lueker, Jonathan Z. Sun	C-Planarity of Extrovert Clustered Graphs.	GD	2005	DBLP DOI BibTeX RDF
18	Federico Della Croce, Bruno Escoffier, Cécile Murat, Vangelis Th. Paschos	Probabilistic Coloring of Bipartite and Split Graphs.	ICCSA (4)	2005	DBLP DOI BibTeX RDF
18	Irit Katriel, Pascal Van Hentenryck	Maintaining Longest Paths in Cyclic Graphs.	CP	2005	DBLP DOI BibTeX RDF
18	Tiziana Calamoneri, Paola Vocca	On the Approximability of the L(h, k)-Labelling Problem on Bipartite Graphs (Extended Abstract).	SIROCCO	2005	DBLP DOI BibTeX RDF
18	David Emms, Simone Severini, Richard C. Wilson 0001, Edwin R. Hancock	Coined Quantum Walks Lift the Cospectrality of Graphs and Trees.	EMMCVPR	2005	DBLP DOI BibTeX RDF
18	Danny Z. Chen, Xiaodong Wu 0001	Efficient Algorithms for k-Terminal Cuts on Planar Graphs.	Algorithmica	2004	DBLP DOI BibTeX RDF
18	Mordecai J. Golin, Yiu-Cho Leung, Yajun Wang	Counting Spanning Trees and Other Structures in Non-constant-jump Circulant Graphs.	ISAAC	2004	DBLP DOI BibTeX RDF
18	Ryuhei Uehara	Canonical Data Structure for Interval Probe Graphs.	ISAAC	2004	DBLP DOI BibTeX RDF	interval probe graph, data structure, Bioinformatics, graph isomorphism
18	Feodor F. Dragan, Chenyu Yan, Derek G. Corneil	Collective Tree Spanners and Routing in AT-free Related Graphs.	WG	2004	DBLP DOI BibTeX RDF
18	Rudolf Wille	Implicational Concept Graphs.	ICCS	2004	DBLP DOI BibTeX RDF
18	Till Tantau	A Logspace Approximation Scheme for the Shortest Path Problem for Graphs with Bounded Independence Number.	STACS	2004	DBLP DOI BibTeX RDF
18	Yon Dourisboure, Cyril Gavoille	Sparse Additive Spanners for Bounded Tree-Length Graphs.	SIROCCO	2004	DBLP DOI BibTeX RDF
18	Jonathan A. Kelner	Spectral partitioning, eigenvalue bounds, and circle packings for graphs of bounded genus.	STOC	2004	DBLP DOI BibTeX RDF	bounded genus, circle packing, partitioning, laplacian, graph separators, spectral partitioning
18	Guy Kortsarz, Zeev Nutov	Approximation algorithm for k-node connected subgraphs via critical graphs.	STOC	2004	DBLP DOI BibTeX RDF
18	Frank Gurski, Egon Wanke	Vertex Disjoint Paths on Clique-Width Bounded Graphs.	LATIN	2004	DBLP DOI BibTeX RDF
18	Les R. Foulds, Horst W. Hamacher, Anita Schöbel, Tadashi Yamaguchi	On Center Cycles in Grid Graphs.	Ann. Oper. Res.	2003	DBLP DOI BibTeX RDF	location of cycles, center problem, network location, grid graph
18	Donatello Conte, Corrado Guidobaldi, Carlo Sansone	A Comparison of Three Maximum Common Subgraph Algorithms on a Large Database of Labeled Graphs.	GbRPR	2003	DBLP DOI BibTeX RDF
18	Sriram Raghavan, Hector Garcia-Molina	Representing Web Graphs.	ICDE	2003	DBLP DOI BibTeX RDF
18	Maria I. Andreou, Sotiris E. Nikoletseas, Paul G. Spirakis	Algorithms and Experiments on Colouring Squares of Planar Graphs.	WEA	2003	DBLP DOI BibTeX RDF
18	Bin Luo 0001, Richard C. Wilson 0001, Edwin R. Hancock	A Spectral Approach to Learning Structural Variations in Graphs.	ICVS	2003	DBLP DOI BibTeX RDF
18	Tru H. Cao	Conceptual Graphs for Modelling and Computing with Generally Quantified Statements.	Modelling with Words	2003	DBLP DOI BibTeX RDF
18	Tali Kaufman, Michael Krivelevich, Dana Ron	Tight Bounds for Testing Bipartiteness in General Graphs.	RANDOM-APPROX	2003	DBLP DOI BibTeX RDF
18	Uriel Feige, Michael Langberg, Gideon Schechtman	Graphs with Tiny Vector Chromatic Numbers and Huge Chromatic Numbers.	FOCS	2002	DBLP DOI BibTeX RDF
18	Tanguy Urvoy	Abstract Families of Graphs.	Developments in Language Theory	2002	DBLP DOI BibTeX RDF
18	Dimitris Fotakis 0001, Sotiris E. Nikoletseas, Vicky G. Papadopoulou, Paul G. Spirakis	Radiocolorings in Periodic Planar Graphs: PSPACE-Completeness and Efficient Approximations for the Optimal Range of Frequencies.	WG	2002	DBLP DOI BibTeX RDF
18	Silke Pollandt	Relation Graphs: A Structure for Representing Relations in Contextual Logic of Relations.	ICCS	2002	DBLP DOI BibTeX RDF
18	Marcus Raitner	HGV: A Library for Hierarchies, Graphs, and Views.	GD	2002	DBLP DOI BibTeX RDF
18	Vida Dujmovic, Pat Morin, David R. Wood	Path-Width and Three-Dimensional Straight-Line Grid Drawings of Graphs.	GD	2002	DBLP DOI BibTeX RDF
18	Oleg Sheyner, Joshua W. Haines, Somesh Jha, Richard Lippmann, Jeannette M. Wing	Automated Generation and Analysis of Attack Graphs.	S&P	2002	DBLP DOI BibTeX RDF	model checking, intrusion detection, attack graph
18	Pizzanu Kanonchayos, Tomoyuki Nishita, Yoshihisa Shinagawa, Tosiyasu L. Kunii	Topological Morphing Using Reeb Graphs.	CW	2002	DBLP DOI BibTeX RDF
18	Prosenjit Bose, Luc Devroye, William S. Evans, David G. Kirkpatrick	On the Spanning Ratio of Gabriel Graphs and beta-skeletons.	LATIN	2002	DBLP DOI BibTeX RDF
18	Tiziana Calamoneri, Rossella Petreschi	L(2, 1)-Coloring Matrogenic Graphs.	LATIN	2002	DBLP DOI BibTeX RDF
18	Jop F. Sibeyn, James Abello, Ulrich Meyer 0001	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
18	Hiroto Kagotani, Takuji Okamoto, Takashi Nanya	Synthesis of four-phase asynchronous control circuits from pipeline dependency graphs.	ASP-DAC	2001	DBLP DOI BibTeX RDF
18	Sergei L. Bezrukov, Robert Elsässer	Edge-Isoperimetric Problems for Cartesian Powers of Regular Graphs.	WG	2001	DBLP DOI BibTeX RDF
18	Tru H. Cao	Generalized Quantifiers and Conceptual Graphs.	ICCS	2001	DBLP DOI BibTeX RDF
18	Balachander Krishnamurthy, Jia Wang 0001	Topology modeling via cluster graphs.	Internet Measurement Workshop	2001	DBLP DOI BibTeX RDF	Internet
18	Andrew Dabrowski, Lawrence S. Moss	The Johnson Graphs Satisfy a Distance Extension Property.	Comb.	2000	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05C12, 05C80
18	Christophe Morvan	On Rational Graphs.	FoSSaCS	2000	DBLP DOI BibTeX RDF
18	Vadim V. Lozin	On a Generalization of Bi-Complement Reducible Graphs.	MFCS	2000	DBLP DOI BibTeX RDF
18	Tanguy Urvoy	Regularity of Congruential Graphs.	MFCS	2000	DBLP DOI BibTeX RDF
18	Ekkehard Köhler	Recognizing Graphs without Asteroidal Triples.	WG	2000	DBLP DOI BibTeX RDF
18	Frithjof Dau	Negations in Simple Concept Graphs.	ICCS	2000	DBLP DOI BibTeX RDF
18	William C. K. Yen, C. Y. Tang	An Optimal Algorithm for Solving the Searchlight Guarding Problem on Weighted Two-Terminal Series-Parallel Graphs.	Acta Informatica	1999	DBLP DOI BibTeX RDF
18	Zoltán Szigeti	On Optimal Ear-Decompositions of Graphs.	IPCO	1999	DBLP DOI BibTeX RDF
18	Xin He, Ming-Yang Kao, Hsueh-I Lu	A Fast General Methodology for Information - Theoretically Optimal Encodings of Graphs.	ESA	1999	DBLP DOI BibTeX RDF
18	Josep Díaz, Mathew D. Penrose, Jordi Petit, Maria J. Serna	Linear Orderings of Random Geometric Graphs.	WG	1999	DBLP DOI BibTeX RDF
18	François Bertault, Mirka Miller	An Algorithm for Drawing Compound Graphs.	GD	1999	DBLP DOI BibTeX RDF
18	Michael Kaufmann 0001, Roland Wiese	Embedding Vertices at Points: Few Bends Suffice for Planar Graphs.	GD	1999	DBLP DOI BibTeX RDF
18	Joost Engelfriet, Tjalling Gelsema	Axioms for Generalized Graphs, Illustrated by a Cantor-Bernstein Proposition.	Acta Informatica	1998	DBLP DOI BibTeX RDF
18	Mikkel Thorup	Map Graphs in Polynomial Time.	FOCS	1998	DBLP DOI BibTeX RDF
18	Walling R. Cyre	Executing Conceptual Graphs.	ICCS	1998	DBLP DOI BibTeX RDF
18	Jan Kratochvíl	Crossing Number of Abstract Topological Graphs.	GD	1998	DBLP DOI BibTeX RDF
18	Klaus Jansen	The Mutual Exclusion Scheduling Problem for Permutation and Comparability Graphs.	STACS	1998	DBLP DOI BibTeX RDF
18	Nabil Hameurlain, Christophe Sibertin-Blanc	Finite Symbolic Reachability Graphs for High-Level Petri Nets.	APSEC	1997	DBLP DOI BibTeX RDF
18	Christopher Umans, William J. Lenhart	Hamiltonian Cycles in Solid Grid Graphs.	FOCS	1997	DBLP DOI BibTeX RDF
18	Amotz Bar-Noy, Guy Kortsarz	The Minimum Color Sum of Bipartite Graphs.	ICALP	1997	DBLP DOI BibTeX RDF
18	Andreas Goerdt	The Giant Component Threshold for Random Regular Graphs with Edge Faults.	MFCS	1997	DBLP DOI BibTeX RDF
18	Helmut Alt, Ulrich Fuchs 0001, Klaus Kriegel	On the Number of Simple Cycles in Planar Graphs.	WG	1997	DBLP DOI BibTeX RDF
18	Ton Kloks, Dieter Kratsch, Haiko Müller	Asteroidal Sets in Graphs.	WG	1997	DBLP DOI BibTeX RDF
18	Martin Erwig	Functional Programming with Graphs.	ICFP	1997	DBLP DOI BibTeX RDF
18	Peter Øhrstrøm	C. S. Pierce and the Quest for Gamma Graphs.	ICCS	1997	DBLP DOI BibTeX RDF
18	Leo G. Kroon, Arunabha Sen, Haiyong Deng, Asim Roy	The Optimal Cost Chromatic Partition Problem for Trees and Interval Graphs.	WG	1996	DBLP DOI BibTeX RDF
18	Luitpold Babel, Stephan Olariu	On the Isomorphism of Graphs with Few P4s.	WG	1995	DBLP DOI BibTeX RDF
18	Andrew Fall	Spanning Tree Representations of Graphs and Orders in Conceptual Structures.	ICCS	1995	DBLP DOI BibTeX RDF
18	Harman van den Berg	Existential Graphs and Dynamic Predicate Logic.	ICCS	1995	DBLP DOI BibTeX RDF
18	Harry B. Hunt III, Madhav V. Marathe, Venkatesh Radhakrishnan, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns	A Unified Approach to Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs.	ESA	1994	DBLP DOI BibTeX RDF
18	Dickson Lukose	Executable Conceptual Structures.	ICCS	1993	DBLP DOI BibTeX RDF
18	Ton Kloks, Hans L. Bodlaender	Approximating Treewidth and Pathwidth of some Classes of Perfect Graphs.	ISAAC	1992	DBLP DOI BibTeX RDF
18	Hans L. Bodlaender	Kayles on Special Classes of Graphs - An Application of Sprague-Grundy Theory.	WG	1992	DBLP DOI BibTeX RDF
18	Walter Unger	The Complexity of Colouring Circle Graphs (Extended Abstract).	STACS	1992	DBLP DOI BibTeX RDF	Classification algorithms and data structures, computational complexity
18	Renato M. Capocelli, Luisa Gargano, Ugo Vaccaro	Time Bound for Broadcasting in Bounded Degree Graphs.	WG	1989	DBLP DOI BibTeX RDF
18	Beverly Jamison, Stephan Olariu	A Linear-Time Recognition Algorithm for P4-Reducible Graphs.	FSTTCS	1989	DBLP DOI BibTeX RDF
18	P. Sreenivasa Kumar, C. E. Veni Madhavan	A New Class of Separators and Planarity of Chordal Graphs.	FSTTCS	1989	DBLP DOI BibTeX RDF
18	Hans L. Bodlaender	Dynamic Programming on Graphs with Bounded Treewidth.	ICALP	1988	DBLP DOI BibTeX RDF	graph decision problems, restrictions of NP-complete problems, local condition compositions, dynamic programming, polynomial time algorithms, Treewidth, partial k-trees
18	Udo W. Lipeck, Dasu Feng	Construction of Deterministic Transition Graphs from Dynamic Integrity Constraints.	WG	1988	DBLP DOI BibTeX RDF
18	Criel Merino, Gelasio Salazar, Jorge Urrutia	On the Intersection Number of Matchings and Minimum Weight Perfect Matchings of Multicolored Point Sets.	Graphs Comb.	2005	DBLP DOI BibTeX RDF	Minimum weight perfect matchings, Perfect matchings, Geometric graphs
18	Stephan Brandt, Mariusz Wozniak	On Cyclic Packing of a Tree.	Graphs Comb.	2004	DBLP DOI BibTeX RDF	Packing of graphs, Distinct lengths labelling
18	David Eppstein, Michael T. Goodrich, Lowell Trott	Going off-road: transversal complexity in road networks.	GIS	2009	DBLP DOI BibTeX RDF	edge crossings, multiscale-dispersed graphs, ray-shooting data structures, road networks, geometric graphs, line transversals
18	Katerina Asdre, Stavros D. Nikolopoulos	The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs.	FAW	2008	DBLP DOI BibTeX RDF	fixed-endpoint path cover, complement reducible graphs, linear-time algorithms, perfect graphs, cographs, path cover
18	Duc T. Ha, Shambhu J. Upadhyaya, Hung Q. Ngo 0001, Suranjan Pramanik, Ramkumar Chinchani, Sunu Mathew	Insider Threat Analysis Using Information-Centric Modeling. (PDF / PS)	IFIP Int. Conf. Digital Forensics	2007	DBLP DOI BibTeX RDF	capability acquisition graphs, key challenge graphs, Insider threats
18	Pradeep Kumar Mishra, Vassil S. Dimitrov	A Graph Theoretic Analysis of Double Base Number Systems.	INDOCRYPT	2007	DBLP DOI BibTeX RDF	DBNS-graphs, MB-graphs, Double base number system
18	Joseph Pamula, Paul Ammann, Sushil Jajodia, Ronald W. Ritchey	A framework for establishing, assessing, and managing trust in inter-organizational relationships.	SWS	2006	DBLP DOI BibTeX RDF	access graphs, network sharing, scalability, network security, vulnerability, attack graphs, exploit
18	Peter Mahlmann, Christian Schindelhauer	Distributed random digraph transformations for peer-to-peer networks.	SPAA	2006	DBLP DOI BibTeX RDF	distributed algorithms, peer-to-peer networks, random graphs, expander graphs
18	Martin Farach-Colton, Yang Huang, John L. L. Woolford	Discovering temporal relations in molecular pathways using protein-protein interactions.	RECOMB	2004	DBLP DOI BibTeX RDF	molecular pathways, probe interval graphs, ribosomal assembly pathway, vertex ordering, interval graphs, protein-protein interaction
18	Marissa P. Justan, Felix P. Muga II, Ivan Hal Sudborough	On the Generalization of the Pancake Network.	ISPAN	2002	DBLP DOI BibTeX RDF	wreath product, diameter of a graph, Cayley graphs, Pancake graphs
18	Bruce A. Draper, Walid A. Najjar, A. P. Wim Böhm, Jeffrey Hammes, Robert Rinker, Charlie Ross, Monica Chawathe, José Bins	Compiling and Optimizing Image Processing Algorithms for FPGAs.	CAMP	2000	DBLP DOI BibTeX RDF	SA-C, language features, SA-C algorithms, performance numbers, image processing routines, Annapolis Microsystems WildForce board, Xilinx 4036XL FPGAs, FPGAs, VHDL, optimizing compiler, high-level language, data flow graphs, data flow graphs, image processing algorithms
18	Xuandong Li, Johan Lilius	Checking compositions of UML sequence diagrams for timing inconsistency.	APSEC	2000	DBLP DOI BibTeX RDF	UML sequence diagram composition checking, timing inconsistency checking, real-time systems specification, system behaviour scenarios, high-level graphs, real-time systems, model checking, Unified Modeling Language, formal verification, graphs, timing, specification languages, sequences, diagrams, object interactions
18	Jin Hyun Son, Myoung-Ho Kim	Finding the critical path in a time-constrained workflow.	RTCSA	2000	DBLP DOI BibTeX RDF	time-constrained workflow, workflow control constructs, workflow control structures, workflow issues, workflow resource management, workflow time management, real-time systems, business processes, queueing theory, directed graphs, directed acyclic graphs, critical path, computer engineering, workflow management software
18	Tao Yang 0009, Cong Fu 0002	Heuristic Algorithms for Scheduling Iterative Task Computations on Distributed Memory Machines.	IEEE Trans. Parallel Distributed Syst.	1997	DBLP DOI BibTeX RDF	iterative task graphs, Scheduling, directed acyclic graphs, software pipelining, granularity, communication optimization
18	Arno Puder, Kurt Geihs	System support for knowledge-based trading in open service markets.	ACM SIGOPS European Workshop	1996	DBLP DOI BibTeX RDF	Open distributed environments, service knowledge base, conceptual graphs, trading, service matching, type graphs
18	Panos A. Patsouris	Two-level-hierarchies of objects: a unit of reference for distributed object-oriented databases.	ICPADS	1996	DBLP DOI BibTeX RDF	two-level-hierarchies of objects, unit of reference, distributed object-oriented databases, partial directed acyclic graphs, vertices objects, Uni-Design, distribution design strategy, distributed databases, aggregation, object-oriented databases, directed graphs, grouping, association, equivalence relation
18	Moreno Coli, Paolo Palazzari	Global execution time minimization by allocating tasks in parallel systems.	PDP	1995	DBLP DOI BibTeX RDF	global execution time minimization, heuristic criterion, starting population, static allocation, genetic algorithms, genetic algorithm, computational complexity, resource allocation, parallel machines, parallel machine, directed graphs, directed acyclic graphs, DAGs, processor scheduling, parallel systems, task allocation, NP-complete problem, execution time, minimisation, cost function, critical path, precedence relations, critical path analysis
18	Arno Puder, S. Markwitz, F. Gudermann	Service Trading Using Conceptual Structures.	ICCS	1995	DBLP DOI BibTeX RDF	Open distributed environments, service knowledge base, conceptual graphs, trading, service matching, type graphs
18	Michel Cosnard, Michel Loi	Automatic task graph generation techniques.	HICSS (2)	1995	DBLP DOI BibTeX RDF	automatic task graph generation techniques, parameterized task graph, problem-size-independent representation, directed acylic task graphs, annotated sequential program, node computational load, edge communication volume, local data structure generation, computation code generation, communication code generation, parallel programming, data structures, directed graphs, programming theory, automatic programming, parallel computation model
18	Christian Scheidler, Lorenz Schäfers, Ottmar Krämer-Fuhrmann	Software engineering for parallel systems: the TRAPPER approach.	HICSS (2)	1995	DBLP DOI BibTeX RDF	TRAPPER, graphical programming environment, graphical design methodology, process graphs, cooperating sequential processes, homogeneous view, software engineering, formal specification, parallel programming, graphical user interfaces, monitoring, graphs, mapping, programming environments, software design, visual programming, software visualization, software performance evaluation, parallel systems, computer aided software engineering, parallel applications, performance monitoring, system monitoring, graphical notations, hierarchical specification, hardware configuration, development cycle, application partitioning