«graph modification»
۳۱۸۰ نتیجهClass Graph Views
An application typically has many conceptually separate pieces of behavior written over a common class graph. Each behavior makes different assumptions about the form of the class graph and the methods provided by the classes. The behaviors’ overlapping assumptions make it diffic
A suffix tree approach to the interpretation of tandem mass spectra: applications to peptides of non-specific digestion and post-translational modifications
MOTIVATION Tandem mass spectrometry combined with sequence database searching is one of the most powerful tools for protein identification. As thousands of spectra are generated by a mass spectrometer in one hour, the speed of database searching is critical, especially when searc
A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing
We introduce the s-Plex Editing problem generalizing the well-studied Cluster Editing problem, both being NP-hard and both being motivated by graph-based data clustering. Instead of transforming a given graph by a minimum number of edge modifications into a disjoint union of cliq
Giraphx: Parallel Yet Serializable Large-Scale Graph Processing
Bulk Synchronous Parallelism (BSP) provides a good model for parallel processing of many large-scale graph applications, however it is unsuitable/inefficient for graph applications that require coordination, such as graph-coloring, subcoloring, and clustering. To address this pro
A More Relaxed Model for Graph-Based Data Clustering: s-Plex Cluster Editing
We introduce the s-Plex Cluster Editing problem as a generalization of the wellstudied Cluster Editing problem, both being NP-hard and both being motivated by graph-based data clustering. Instead of transforming a given graph by a minimum number of edge modifications into a disjo
The Dynamic Graph Clustering Problem - ILP-Based Approaches Balancing Optimality and the Mental Map
Clustering is an established tool for the analysis of networks or network-like data. The partitioning of the graph of a network into so-called clusters is meant to yield insights into its function, and to reveal common properties amongst nodes, as well as properties of individual
Complexity Classification of Some Edge Modification Problems
In an edge modification problem one has to change the edge set of a given graph as little as possible so as to satisfy a certain property. We prove the NP-hardness of a variety of edge modification problems with respect to some well-studied classes of graphs. These include perfec
What is the furthest graph from a hereditary property?
For a graph property P, the edit distance of a graph G from P, denoted EP(G), is the minimum number of edge modifications (additions or deletions) one needs to apply to G in order to turn it into a graph satisfying P. What is the furthest graph on n vertices from P and what is th
An Open Framework for Reverse Engineering Graph Data Visualization
Reverse engineering (briefly RE) provides a conceptual framework for describing the process of software understanding and concept abstraction. Most RE software tools for use some form of visual representation and manipulation of the RE data. In most cases, such data consists of a
Architectural Considerations in Systems Supporting Dynamic Workflow Modification
One of the major limitations of current workflow technology is the lack of flexibility necessary to support the dynamic nature of most business processes today. We present dynamic modification of workflows as a means of providing the technological support necessary for adapting w