Sciweavers

3105 search results - page 249 / 621
» The Path-Packing Structure of Graphs
Sort
View
LATA
2010
Springer
16 years 1 months ago
Untestable Properties Expressible with Four First-Order Quantifiers
Abstract. In property testing, the goal is to distinguish between structures that have some desired property and those that are far from having the property, after examining only a...
Charles Jordan and Thomas Zeugmann
SSDBM
2007
IEEE
107views Database» more  SSDBM 2007»
15 years 10 months ago
Efficient Evaluation of Inbreeding Queries on Pedigree Data
We consider pedigree data structured in the form of a directed acyclic graph, and use an encoding scheme, called NodeCodes, for expediting the evaluation of queries on pedigree gr...
Brendan Elliott, Suleyman Fatih Akgul, Stephen May...
CPAIOR
2007
Springer
15 years 10 months ago
Necessary Condition for Path Partitioning Constraints
Given a directed graph G, the K node-disjoint paths problem consists in finding a partition of G into K node-disjoint paths, such that each path ends up in a given subset of nodes...
Nicolas Beldiceanu, Xavier Lorca
BIRTHDAY
2005
Springer
15 years 9 months ago
Observing Reductions in Nominal Calculi Via a Graphical Encoding of Processes
The paper introduces a novel approach to the synthesis of labelled transition systems for calculi with name mobility. The proposal is based on a graphical encoding: Each process is...
Fabio Gadducci, Ugo Montanari
ECBS
2003
IEEE
145views Hardware» more  ECBS 2003»
15 years 9 months ago
Model Checking and Evidence Exploration
We present an algebraic framework for evidence exploration: the process of interpreting, manipulating, and navigating the proof structure or evidence produced by a model checker w...
Yifei Dong, C. R. Ramakrishnan, Scott A. Smolka