Tag #graph
2876 papers:
PADL-2020-ChanC #distance #edit distance #flexibility #programming #set #using- Flexible Graph Matching and Graph Edit Distance Using Answer Set Programming (SCC, JC), pp. 20–36.
- PADL-2020-TarauB #interactive #mining #prolog
- Interactive Text Graph Mining with a Prolog-based Dialog Engine (PT, EB0), pp. 3–19.
ASPLOS-2020-KalinskyKE #architecture #relational- The TrieJax Architecture: Accelerating Graph Operations Through Relational Joins (OK, BK, YE), pp. 1217–1231.
CC-2020-BrauckmannGEC #learning #modelling- Compiler-based graph representations for deep learning models of code (AB, AG, SE, JC), pp. 201–211.
CGO-2020-ChenPPLR #adaptation #named- ATMem: adaptive data placement in graph applications on heterogeneous memories (YC, IBP, ZP, XL, BR), pp. 293–304.
- CGO-2020-ZhangBCDKAS #algorithm #optimisation #order
- Optimizing ordered graph algorithms with GraphIt (YZ, AB, XC, LD, SK, SPA, JS), pp. 158–170.
EDM-2019-DavisWY #education #n-gram #topic- N-gram Graphs for Topic Extraction in Educational Forums (GMD, CW, CY).
- EDM-2019-HuR #estimation #network #performance
- Academic Performance Estimation with Attention-based Graph Convolutional Networks (QH, HR).
- EDM-2019-Venantd #complexity #concept #predict #semantics #towards
- Towards the Prediction of Semantic Complexity Based on Concept Graphs (RV, Md).
ICSME-2019-SunXCBW0 #programming- Know-How in Programming Tasks: From Textual Tutorials to Task-Oriented Knowledge Graph (JS, ZX, RC, HB, JW, XP0), pp. 257–268.
MSR-2019-BenelallamHSBB #dependence #representation- The maven dependency graph: a temporal graph-based representation of maven central (AB, NH, CSV, BB, OB), pp. 344–348.
- MSR-2019-PietriSZ #dataset #development
- The software heritage graph dataset: public software development under one roof (AP, DS, SZ), pp. 138–142.
SANER-2019-XieCYLHDZ #approach #learning #named- DeepLink: A Code Knowledge Graph Based Deep Learning Approach for Issue-Commit Link Recovery (RX, LC, WY0, ZL, TH, DD, SZ), pp. 434–444.
CIAA-2019-FujiyoshiP #automaton #finite #set- A Simple Extension to Finite Tree Automata for Defining Sets of Labeled, Connected Graphs (AF, DP), pp. 121–132.
AIIDE-2019-WareGSF #experience #multi- Multi-Agent Narrative Experience Management as Story Graph Pruning (SGW, ETG, AS, RF), pp. 87–93.
CoG-2019-AbuzuraiqFP #clustering #framework #generative #named- Taksim: A Constrained Graph Partitioning Framework for Procedural Content Generation (AMA, AF, PP), pp. 1–8.
- CoG-2019-BarzdinsGBLBC #challenge #database
- RDF* Graph Database as Interlingua for the TextWorld Challenge (GB, DG, PFB, UL, GB, EC), pp. 1–2.
- CoG-2019-BeigKCM #game studies #named
- G-SpAR: GPU-Based Voxel Graph Pathfinding for Spatial Audio Rendering in Games and VR (MB, BK, KC, PMB), pp. 1–8.
- CoG-2019-CookR #analysis #automation #game studies
- Hyperstate Space Graphs for Automated Game Analysis (MC0, AR), pp. 1–8.
- CoG-2019-KimLLHK #algorithm #automation #game studies #generative #using
- Automatic Generation of Game Content using a Graph-based Wave Function Collapse Algorithm (HK, SL, HL, TH, SK), pp. 1–4.
- CoG-2019-LipinskiSRA #generative #incremental #using
- Level Graph - Incremental Procedural Generation of Indoor Levels using Minimum Spanning Trees (BvRL, SS, JR, DA), pp. 1–7.
- CoG-2019-Wallne
- Enhancing Battle Maps through Flow Graphs (GW), pp. 1–4.
FDG-2019-PartlanCKSHSMSE #evaluation #interactive #representation- Evaluation of an automatically-constructed graph-based representation for interactive narrative (NP, EC, EK, SS, CH, GS, CM, SCS, MSEN), p. 9.
CIKM-2019-0002CZTZG #classification #named- Meta-GNN: On Few-shot Node Classification in Graph Meta-learning (FZ0, CC, KZ, GT, TZ, JG), pp. 2357–2360.
- CIKM-2019-AdriaensABGL
- Discovering Interesting Cycles in Directed Graphs (FA, ÇA, TDB, AG, JL), pp. 1191–1200.
- CIKM-2019-BaiYK0LY #network #predict
- Spatio-Temporal Graph Convolutional and Recurrent Networks for Citywide Passenger Demand Prediction (LB, LY, SSK, XW0, WL0, ZY), pp. 2293–2296.
- CIKM-2019-BespinyowongT #named
- kBrowse: kNN Graph Browser (RB, AKHT), pp. 2933–2936.
- CIKM-2019-ChekolS #performance
- Leveraging Graph Neighborhoods for Efficient Inference (MWC, HS), pp. 1893–1902.
- CIKM-2019-ChenLYZS #network
- Knowledge-aware Textual Entailment with Graph Attention Network (DC, YL, MY0, HTZ, YS), pp. 2145–2148.
- CIKM-2019-ChristmannRASW #using
- Look before you Hop: Conversational Question Answering over Knowledge Graphs Using Judicious Context Expansion (PC, RSR, AA, JS, GW), pp. 729–738.
- CIKM-2019-DongZHSL #detection #multi #network
- Multiple Rumor Source Detection with Graph Convolutional Networks (MD, BZ, NQVH, HS, GL), pp. 569–578.
- CIKM-2019-DuanX #enterprise #information management
- Enterprise Knowledge Graph From Specific Business Task to Enterprise Knowledge Management (RD, YX), pp. 2965–2966.
- CIKM-2019-DuttaL #clique #statistics
- Finding a Maximum Clique in Dense Graphs via χ2 Statistics (SD0, JL), pp. 2421–2424.
- CIKM-2019-FanZDCSL #approach #identification #learning #network #novel
- Learning to Identify High Betweenness Centrality Nodes from Scratch: A Novel Graph Neural Network Approach (CF, LZ, YD, MC, YS, ZL), pp. 559–568.
- CIKM-2019-HouFZYLWWXS #android #detection #named #robust
- αCyber: Enhancing Robustness of Android Malware Detection System against Adversarial Attacks on Heterogeneous Graph based Model (SH, YF, YZ, YY, JL, WW, JW, QX, FS), pp. 609–618.
- CIKM-2019-HuangYX #detection #learning
- System Deterioration Detection and Root Cause Learning on Time Series Graphs (HH, SY, YX), pp. 2537–2545.
- CIKM-2019-IslamMR #named #network #predict #social #using
- NActSeer: Predicting User Actions in Social Network using Graph Augmented Neural Network (MRI, SM, NR), pp. 1793–1802.
- CIKM-2019-JiangWZSLL #detection #learning #representation
- Cross-domain Aspect Category Transfer and Detection via Traceable Heterogeneous Graph Representation Learning (ZJ, JW, LZ, CS, YL, XL), pp. 289–298.
- CIKM-2019-JiaoXZZ #network #predict
- Collective Link Prediction Oriented Network Embedding with Hierarchical Graph Attention (YJ, YX, JZ, YZ), pp. 419–428.
- CIKM-2019-JinOLLLC #learning #semantics #similarity
- Learning Region Similarity over Spatial Knowledge Graphs with Hierarchical Types and Semantic Relations (XJ, BO, SL, DL, KHL, LC), pp. 669–678.
- CIKM-2019-LeeRKKKR #network
- Graph Convolutional Networks with Motif-based Attention (JBL, RAR, XK, SK, EK, AR), pp. 499–508.
- CIKM-2019-LiCWZW #feature model #interactive #modelling #named #network #predict
- Fi-GNN: Modeling Feature Interactions via Graph Neural Networks for CTR Prediction (ZL, ZC, SW, XZ, LW0), pp. 539–548.
- CIKM-2019-LiGLCYN #hashtag #network #recommendation
- Long-tail Hashtag Recommendation for Micro-videos with Graph Convolutional Network (ML, TG, ML, ZC, JY, LN), pp. 509–518.
- CIKM-2019-LiQLYL #detection #network #overview
- Spam Review Detection with Graph Convolutional Networks (AL, ZQ, RL, YY, DL), pp. 2703–2711.
- CIKM-2019-LiuWYZSMZGZYQ #learning #mobile #optimisation #representation
- Graph Representation Learning for Merchant Incentive Optimization in Mobile Payment Marketing (ZL, DW, QY, ZZ, YS, JM, WZ, JG, JZ, SY, YQ), pp. 2577–2584.
- CIKM-2019-LiuZH #network #representation #towards
- Towards Explainable Representation of Time-Evolving Graphs via Spatial-Temporal Graph Attention Networks (ZL, DZ, JH), pp. 2137–2140.
- CIKM-2019-LiYH #clustering #realtime
- Real-time Edge Repartitioning for Dynamic Graph (HL, HY, JH), pp. 2125–2128.
- CIKM-2019-MaAWSCTY #data analysis #learning #similarity
- Deep Graph Similarity Learning for Brain Data Analysis (GM, NKA, TLW, DS, MWC, NBTB, PSY), pp. 2743–2751.
- CIKM-2019-MauryaLM #approximate #network #performance
- Fast Approximations of Betweenness Centrality with Graph Neural Networks (SKM, XL0, TM), pp. 2149–2152.
- CIKM-2019-MohantyR #effectiveness #named #towards
- Insta-Search: Towards Effective Exploration of Knowledge Graphs (MM, MR), pp. 2909–2912.
- CIKM-2019-QiuLHY #network #order #recommendation
- Rethinking the Item Order in Session-based Recommendation with Graph Neural Networks (RQ, JL, ZH, HY), pp. 579–588.
- CIKM-2019-SalhaLHTV #predict
- Gravity-Inspired Graph Autoencoders for Directed Link Prediction (GS, SL, RH, VAT, MV), pp. 589–598.
- CIKM-2019-Sanei-MehriZST #estimation #named
- FLEET: Butterfly Estimation from a Bipartite Graph Stream (SVSM, YZ, AES, ST), pp. 1201–1210.
- CIKM-2019-ShenTB #learning #representation
- GRLA 2019: The first International Workshop on Graph Representation Learning and its Applications (HS, JT, PB), pp. 2997–2998.
- CIKM-2019-ShresthaMAV #behaviour #interactive #learning #social
- Learning from Dynamic User Interaction Graphs to Forecast Diverse Social Behavior (PS, SM, DA, SV), pp. 2033–2042.
- CIKM-2019-VakulenkoGPRC #message passing
- Message Passing for Complex Question Answering over Knowledge Graphs (SV, JDFG, AP, MdR, MC), pp. 1431–1440.
- CIKM-2019-VazirgiannisNS #kernel #machine learning
- Machine Learning on Graphs with Kernels (MV, GN, GS), pp. 2983–2984.
- CIKM-2019-Wang0C #learning #reasoning #recommendation
- Learning and Reasoning on Graph for Recommendation (XW, XH0, TSC), pp. 2971–2972.
- CIKM-2019-WangRCR0R #learning #predict
- Order-free Medicine Combination Prediction with Graph Convolutional Reinforcement Learning (SW, PR, ZC, ZR, JM0, MdR), pp. 1623–1632.
- CIKM-2019-WuPDTZD #distance #learning #network
- Long-short Distance Aggregation Networks for Positive Unlabeled Graph Learning (MW, SP, LD, IWT, XZ, BD), pp. 2157–2160.
- CIKM-2019-XieXYZ #multi
- EHR Coding with Multi-scale Feature Attention and Structured Knowledge Graph Propagation (XX, YX, PSY, YZ), pp. 649–658.
- CIKM-2019-XuHY #learning #network #scalability
- Scalable Causal Graph Learning through a Deep Neural Network (CX, HH, SY), pp. 1853–1862.
- CIKM-2019-XuLHLX0 #e-commerce #network #recommendation #social
- Relation-Aware Graph Convolutional Networks for Agent-Initiated Social E-Commerce Recommendation (FX, JL, ZH, YL0, YX, XX0), pp. 529–538.
- CIKM-2019-YangWCW #network #predict #using
- Using External Knowledge for Financial Event Prediction Based on Graph Neural Networks (YY, ZW, QC, LW), pp. 2161–2164.
- CIKM-2019-YeWYJZXY #behaviour #network #representation
- Bayes EMbedding (BEM): Refining Representation by Integrating Knowledge Graphs and Behavior-specific Networks (YY, XW, JY, KJ, JZ, YX, HY), pp. 679–688.
- CIKM-2019-ZhangG0G #evolution #on the
- On Continuously Matching of Evolving Graph Patterns (QZ, DG, XZ0, AG), pp. 2237–2240.
- CIKM-2019-ZhaoCXLZ0 #classification
- Hashing Graph Convolution for Node Classification (WZ, ZC, CX, CL, TZ0, JY0), pp. 519–528.
- CIKM-2019-ZhaoPZZWZXJ #distributed #scalability #visual notation
- Large-Scale Visual Search with Binary Distributed Graph at Alibaba (KZ, PP, YZ, YZ, CW, YZ, YX, RJ), pp. 2567–2575.
- CIKM-2019-ZhaoSSW #learning #named #precise #retrieval
- GRAPHENE: A Precise Biomedical Literature Retrieval Engine with Graph Augmented Deep Learning and External Knowledge Empowerment (SZ, CS, AS, FW), pp. 149–158.
ECIR-p1-2019-AgarwalRS - Retrieving Relationships from a Knowledge Graph for Question Answering (PA, MR, GMS), pp. 35–50.
- ECIR-p1-2019-DavilaJSGZ #image #named #using
- Tangent-V: Math Formula Image Search Using Line-of-Sight Graphs (KD, RJ, SS, VG, RZ), pp. 681–695.
- ECIR-p1-2019-FlorescuJ #learning #representation
- A Supervised Keyphrase Extraction System Based on Graph Representation Learning (CF, WJ), pp. 197–212.
- ECIR-p1-2019-KishimotoHASK
- Binarized Knowledge Graph Embeddings (KK, KH, GA, MS, KK), pp. 181–196.
- ECIR-p1-2019-MackenzieMPCS #recursion
- Compressing Inverted Indexes with Recursive Graph Bisection: A Reproducibility Study (JM, AM, MP, JSC, TS), pp. 339–352.
- ECIR-p2-2019-HalkidiK #assessment #clustering #named #quality
- QGraph: A Quality Assessment Index for Graph Clustering (MH, IK), pp. 70–77.
ICML-2019-0008TO - Hyperbolic Disk Embeddings for Directed Acyclic Graphs (RS0, RT, SO), pp. 6066–6075.
- ICML-2019-Abu-El-HaijaPKA #architecture #higher-order #named
- MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixing (SAEH, BP, AK, NA, KL, HH, GVS, AG), pp. 21–29.
- ICML-2019-AletJVRLK #adaptation #memory management #network
- Graph Element Networks: adaptive, structured computation and memory (FA, AKJ, MBV, AR, TLP, LPK), pp. 212–222.
- ICML-2019-BaranchukPSB #learning #similarity
- Learning to Route in Similarity Graphs (DB, DP, AS, AB), pp. 475–484.
- ICML-2019-BojchevskiG
- Adversarial Attacks on Node Embeddings via Graph Poisoning (AB, SG), pp. 695–704.
- ICML-2019-BoseH #composition #constraints
- Compositional Fairness Constraints for Graph Embeddings (AJB, WLH), pp. 715–724.
- ICML-2019-ChenW0R #algorithm #incremental #performance
- Fast Incremental von Neumann Graph Entropy Computation: Theory, Algorithm, and Applications (PYC, LW, SL0, IR), pp. 1091–1101.
- ICML-2019-CortesDGMY #feedback #learning #online
- Online Learning with Sleeping Experts and Feedback Graphs (CC, GD, CG, MM, SY), pp. 1370–1378.
- ICML-2019-CortesDMZG #learning
- Active Learning with Disagreement Graphs (CC, GD, MM, NZ, CG), pp. 1379–1387.
- ICML-2019-FranceschiNPH #learning #network
- Learning Discrete Structures for Graph Neural Networks (LF, MN, MP, XH), pp. 1972–1982.
- ICML-2019-GaoJ
- Graph U-Nets (HG, SJ), pp. 2083–2092.
- ICML-2019-GaoWH #data analysis #geometry
- Geometric Scattering for Graph Data Analysis (FG, GW, MJH), pp. 2122–2131.
- ICML-2019-GroverZE #generative #modelling #named
- Graphite: Iterative Generative Modeling of Graphs (AG, AZ, SE), pp. 2434–2444.
- ICML-2019-GuoSH #dependence #learning #relational
- Learning to Exploit Long-term Relational Dependencies in Knowledge Graphs (LG, ZS, WH0), pp. 2505–2514.
- ICML-2019-HendrickxOS #learning
- Graph Resistance and Learning from Pairwise Comparisons (JMH, AO, VS), pp. 2702–2711.
- ICML-2019-JeongKKN #modelling #music #network #performance
- Graph Neural Network for Music Score Data and Modeling Expressive Piano Performance (DJ, TK, YK, JN), pp. 3060–3070.
- ICML-2019-LeeLK #self
- Self-Attention Graph Pooling (JL, IL, JK), pp. 3734–3743.
- ICML-2019-LiGDVK #learning #network #similarity
- Graph Matching Networks for Learning the Similarity of Graph Structured Objects (YL, CG, TD, OV, PK), pp. 3835–3845.
- ICML-2019-Ma0KW0 #network
- Disentangled Graph Convolutional Networks (JM, PC0, KK, XW0, WZ0), pp. 4212–4221.
- ICML-2019-MaoFRAFW #estimation #order #probability
- A Baseline for Any Order Gradient Estimation in Stochastic Computation Graphs (JM, JNF, TR, MAS, GF, SW), pp. 4343–4351.
- ICML-2019-MehtaCR #network #probability
- Stochastic Blockmodels meet Graph Neural Networks (NM, LC, PR), pp. 4466–4474.
- ICML-2019-MercadoT0 #clustering #matrix
- Spectral Clustering of Signed Graphs via Matrix Power Means (PM0, FT, MH0), pp. 4526–4536.
- ICML-2019-Murphy0R0 #relational
- Relational Pooling for Graph Representations (RLM, BS0, VAR, BR0), pp. 4663–4673.
- ICML-2019-ObermeyerBJPCRG
- Tensor Variable Elimination for Plated Factor Graphs (FO, EB, MJ, NP, JC, AMR, NDG), pp. 4871–4880.
- ICML-2019-QuBT #markov #named #network
- GMNN: Graph Markov Neural Networks (MQ, YB, JT0), pp. 5241–5250.
- ICML-2019-RieckBB #classification #persistent
- A Persistent Weisfeiler-Lehman Procedure for Graph Classification (BR, CB, KMB), pp. 5448–5458.
- ICML-2019-SafaviB #multi
- Tractable n-Metrics for Multiple Graphs (SS, JB), pp. 5568–5578.
- ICML-2019-TzengW #detection #distributed
- Distributed, Egocentric Representations of Graphs for Detecting Critical Structures (RCT, SHW), pp. 6354–6362.
- ICML-2019-VayerCTCF
- Optimal Transport for structured data with application on graphs (TV, NC, RT, LC, RF), pp. 6275–6284.
- ICML-2019-WalkerG #process
- Graph Convolutional Gaussian Processes (IW, BG), pp. 6495–6504.
- ICML-2019-WuSZFYW #network
- Simplifying Graph Convolutional Networks (FW, AHSJ, TZ, CF, TY, KQW), pp. 6861–6871.
- ICML-2019-XuLZC #learning
- Gromov-Wasserstein Learning for Graph Matching and Node Embedding (HX, DL, HZ, LC), pp. 6932–6941.
- ICML-2019-YouYL #network
- Position-aware Graph Neural Networks (JY, RY, JL), pp. 7134–7143.
- ICML-2019-YuCGY #learning #named #network
- DAG-GNN: DAG Structure Learning with Graph Neural Networks (YY, JC, TG, MY), pp. 7154–7163.
- ICML-2019-ZhangHK #design #distributed #named #network
- Circuit-GNN: Graph Neural Networks for Distributed Circuit Design (GZ, HH, DK), pp. 7364–7373.
- ICML-2019-ZhuSLHB #fault tolerance #learning
- Improved Dynamic Graph Learning through Fault-Tolerant Sparsification (CJZ, SS, KyL, SH, JB), pp. 7624–7633.
KDD-2019-0001WAT #network- Graph Convolutional Networks with EigenPooling (YM0, SW, CCA, JT), pp. 723–731.
- KDD-2019-0009ZGZNQH #framework #named #recommendation #scalability
- IntentGC: A Scalable Graph Convolution Framework Fusing Heterogeneous Information for Recommendation (JZ0, ZZ, ZG, WZ0, WN, GQ, XH), pp. 2347–2357.
- KDD-2019-Chang #clique #performance #scalability
- Efficient Maximum Clique Computation over Large Sparse Graphs (LC), pp. 529–538.
- KDD-2019-ChiangLSLBH #algorithm #clustering #named #network #performance #scalability
- Cluster-GCN: An Efficient Algorithm for Training Deep and Large Graph Convolutional Networks (WLC, XL, SS, YL0, SB, CJH), pp. 257–266.
- KDD-2019-DengRN #learning #predict #social
- Learning Dynamic Context Graphs for Predicting Social Events (SD, HR, YN), pp. 1007–1016.
- KDD-2019-FanZHSHML #network #recommendation
- Metapath-guided Heterogeneous Graph Neural Network for Intent Recommendation (SF, JZ, XH, CS, LH, BM, YL), pp. 2478–2486.
- KDD-2019-GaoJ #learning #network #representation
- Graph Representation Learning via Hard and Channel-Wise Attention Networks (HG, SJ), pp. 741–749.
- KDD-2019-GaoPH #network #random
- Conditional Random Field Enhanced Graph Convolutional Neural Networks (HG, JP, HH), pp. 276–284.
- KDD-2019-HanYZSLZ0K #identification #matrix #named #network
- GCN-MF: Disease-Gene Association Identification By Graph Convolutional Networks and Matrix Factorization (PH, PY, PZ, SS, YL0, JZ, XG0, PK), pp. 705–713.
- KDD-2019-HouCLCY #framework #learning #representation
- A Representation Learning Framework for Property Graphs (YH, HC, CL, JC, MCY), pp. 65–73.
- KDD-2019-HuangSLH #network #random
- Graph Recurrent Networks With Attributed Random Walks (XH, QS, YL, XH), pp. 732–740.
- KDD-2019-JiangZ00C0 #novel #representation
- The Role of: A Novel Scientific Knowledge Graph Representation and Construction Model (TJ, TZ, BQ0, TL0, NVC, MJ0), pp. 1634–1642.
- KDD-2019-JiaSSB #learning
- Graph-based Semi-Supervised & Active Learning for Edge Flows (JJ, MTS, SS, ARB), pp. 761–771.
- KDD-2019-LiHCSWZP #predict
- Predicting Path Failure In Time-Evolving Graphs (JL, ZH, HC, JS, PW, JZ, LP), pp. 1279–1289.
- KDD-2019-LiuSPR #case study
- Characterizing and Forecasting User Engagement with In-App Action Graph: A Case Study of Snapchat (YL, XS, LP, XR), pp. 2023–2031.
- KDD-2019-ParkKDZF #network #using
- Estimating Node Importance in Knowledge Graphs Using Graph Neural Networks (NP, AK, XLD, TZ, CF), pp. 596–606.
- KDD-2019-VermaZ #network
- Stability and Generalization of Graph Convolutional Neural Networks (SV, ZLZ), pp. 1539–1548.
- KDD-2019-Wang00LC #named #network #recommendation
- KGAT: Knowledge Graph Attention Network for Recommendation (XW, XH0, YC0, ML0, TSC), pp. 950–958.
- KDD-2019-WangLZ #adaptation #ambiguity #learning
- Adaptive Graph Guided Disambiguation for Partial Label Learning (DBW, LL0, MLZ), pp. 83–91.
- KDD-2019-WangYCW00 #matrix #modelling #predict
- Origin-Destination Matrix Prediction via Graph Convolution: a New Perspective of Passenger Demand Modeling (YW, HY, HC, TW, JX0, KZ0), pp. 1227–1235.
- KDD-2019-WangZZLZLW #network #recommendation
- Knowledge-aware Graph Neural Networks with Label Smoothness Regularization for Recommender Systems (HW, FZ, MZ, JL, MZ, WL, ZW), pp. 968–977.
- KDD-2019-WuHX #classification #named #network
- DEMO-Net: Degree-specific Graph Neural Networks for Node and Graph Classification (JW, JH, JX), pp. 406–415.
- KDD-2019-WuYZXZPXA #kernel #random #scalability #using
- Scalable Global Alignment Graph Kernel Using Random Features: From Node Embedding to Graph Embedding (LW, IEHY, ZZ0, KX, LZ0, XP0, YX, CCA), pp. 1418–1428.
- KDD-2019-Xia #analysis #platform
- Roll of Unified Graph Analysis Platforms (YX), p. 3179.
- KDD-2019-Yang #framework #named #network #platform
- AliGraph: A Comprehensive Graph Neural Network Platform (HY), pp. 3165–3166.
- KDD-2019-YangRLC #named #recursion #sketching
- NodeSketch: Highly-Efficient Graph Embeddings via Recursive Sketching (DY, PR, BL, PCM), pp. 1162–1172.
- KDD-2019-YinW #scalability
- Scalable Graph Embeddings via Sparse Transpose Proximities (YY, ZW), pp. 1429–1437.
- KDD-2019-YoonHSF #approach #detection #performance
- Fast and Accurate Anomaly Detection in Dynamic Graphs with a Two-Pronged Approach (MY, BH, KS, CF), pp. 647–657.
- KDD-2019-YoshidaTK #learning #metric #mining
- Learning Interpretable Metric between Graphs: Convex Formulation and Computation with Graph Mining (TY, IT, MK), pp. 1026–1036.
- KDD-2019-ZhangLTDYZGWSLW #named #scalability #towards
- OAG: Toward Linking Large-scale Heterogeneous Entity Graphs (FZ, XL, JT, YD, PY, JZ, XG, YW, BS, RL, KW), pp. 2585–2595.
- KDD-2019-ZhangSHSC #network
- Heterogeneous Graph Neural Network (CZ, DS, CH0, AS, NVC), pp. 793–803.
- KDD-2019-ZhuZ00 #network #robust
- Robust Graph Convolutional Networks Against Adversarial Attacks (DZ, ZZ, PC0, WZ0), pp. 1399–1407.
- KDD-2019-ZugnerG #network #robust
- Certifiable Robustness and Robust Training for Graph Convolutional Networks (DZ, SG), pp. 246–256.
MoDELS-2019-BurV #estimation #query #runtime #towards- Towards WCET Estimation of Graph Queries@Run.time (MB, DV), pp. 233–238.
PLDI-2019-DhulipalaBS #streaming #using- Low-latency graph streaming using compressed purely-functional trees (LD, GEB, JS), pp. 918–934.
ASE-2019-DuCWLSC #named- CocoQa: Question Answering for Coding Conventions Over Knowledge Graphs (TD, JC, QW, WL, BS, YC), pp. 1086–1089.
- ASE-2019-Gu00 #api #approach #kernel #named
- CodeKernel: A Graph Kernel Based Approach to the Selection of API Usage Examples (XG, HZ0, SK0), pp. 590–601.
- ASE-2019-Yu #empirical #python
- Empirical Study of Python Call Graph (LY), pp. 1274–1276.
ESEC-FSE-2019-Cetin #developer #identification #traceability #using- Identifying the most valuable developers using artifact traceability graphs (HAC), pp. 1196–1198.
- ESEC-FSE-2019-HiraoMIM #approach #code review #empirical #overview
- The review linkage graph for code review analytics: a recovery approach and empirical study (TH, SM, AI, KM), pp. 578–589.
- ESEC-FSE-2019-KalhaugeP #dependence #reduction
- Binary reduction of dependency graphs (CGK, JP), pp. 556–566.
- ESEC-FSE-2019-Papachristou #clustering #semantics
- Software clusterings with vector semantics and the call graph (MP), pp. 1184–1186.
- ESEC-FSE-2019-Sulun #traceability #using
- Suggesting reviewers of software artifacts using traceability graphs (ES), pp. 1250–1252.
- ESEC-FSE-2019-Vandenbogaerde #contract #design #framework
- A graph-based framework for analysing the design of smart contracts (BV), pp. 1220–1222.
- ICSE-2019-FanLLWNZL #analysis #android #learning #using
- Graph embedding based familial analysis of Android malware using unsupervised learning (MF, XL, JL0, MW, CN, QZ, TL0), pp. 771–782.
- ICSE-2019-NguyenNDNTH #fine-grained #mining #semantics
- Graph-based mining of in-the-wild, fine-grained, semantic code change patterns (HAN, TNN, DD, SN, HT, MH), pp. 819–830.
SLE-2019-SeiferHLLS #empirical #java #open source #query- Empirical study on the usage of graph query languages in open source Java projects (PS, JH, ML, RL, SS), pp. 152–166.
- ASPLOS-2019-DathathriGHP #distributed #named
- Phoenix: A Substrate for Resilient Distributed Graph Analytics (RD, GG, LH, KP), pp. 615–630.
- ASPLOS-2019-XuV0 #named #predict
- PnP: Pruning and Prediction for Point-To-Point Iterative Graph Analytics (CX, KV, RG0), pp. 587–600.
- ASPLOS-2019-ZhangL0HLG #multi #named #performance
- DiGraph: An Efficient Path-based Iterative Directed Graph Processing System on Multiple GPUs (YZ0, XL, HJ0, BH, HL, LG0), pp. 601–614.
CASE-2019-ChinnappaC - Average Consensus in Matrix-Weight-Balanced Digraphs (YC, DC), pp. 1637–1642.
- CGO-2019-SunBSB #reasoning #using
- Reasoning about the Node.js Event Loop using Async Graphs (HS, DB, FS, WB), pp. 61–72.
FASE-2019-GieseMSS #logic #metric- Metric Temporal Graph Logic over Typed Attributed Graphs (HG, MM, LS, SS0), pp. 282–298.
- FASE-2019-SchneiderLO #approach #incremental
- A Logic-Based Incremental Approach to Graph Repair (SS0, LL, FO), pp. 151–167.
JCDL-2018-Lauscher0GSRADZ #database #library- Linked Open Citation Database: Enabling Libraries to Contribute to an Open and Interconnected Citation Graph (AL, KE0, LG, AS, STRR, SA, AD, PZ, AK), pp. 109–118.
- EDM-2018-AlsaadBGSZ #concept #dependence #mining
- Mining MOOC Lecture Transcripts to Construct Concept Dependency Graphs (FA, AB, CG, HS, CZ).
- ICSME-2018-LiLSXPLZ #api #mining
- Improving API Caveats Accessibility by Mining API Caveats Knowledge Graph (HL, SL, JS, ZX, XP0, ML, XZ), pp. 183–193.
- MSR-2018-GeigerMPPNB #android #commit #dataset
- A graph-based dataset of commit history of real-world Android apps (FXG, IM, LP, FP, DDN, AB), pp. 30–33.
- SANER-2018-HanLLXF #named #reasoning
- DeepWeak: Reasoning common software weaknesses via knowledge graph embedding (ZH, XL0, HL, ZX, ZF0), pp. 456–466.
- SANER-2018-MoverSOC #corpus #framework #mining
- Mining framework usage graphs from app corpora (SM, SS0, RBPO, BYEC), pp. 277–289.
SCAM-2018-AntalHTFG #case study #comparative #javascript #research- [Research Paper] Static JavaScript Call Graphs: A Comparative Study (GA, PH, ZT, RF, TG), pp. 177–186.
DLT-2018-Crespi-Reghizzi #automaton- Deque Languages, Automata and Planar Graphs (SCR, PSP), pp. 243–255.
SEFM-2018-ArndtJMN #analysis- Graph-Based Shape Analysis Beyond Context-Freeness (HA, CJ, CM, TN0), pp. 271–286.
- CIG-2018-KraaijerKMR #game studies #generative #geometry
- Geometry and Generation of a New Graph Planarity Game (RK, MJvK, WM, AvR), pp. 1–8.
- FDG-2018-SmithPV #generative #programming #set #using
- Graph-based generation of action-adventure dungeon levels using answer set programming (TS0, JAP, AV), p. 10.
- CIKM-2018-AkramiGHL
- Re-evaluating Embedding-Based Knowledge Graph Completion Methods (FA, LG, WH, CL), pp. 1779–1782.
- CIKM-2018-AslayNMG #evolution #mining
- Mining Frequent Patterns in Evolving Graphs (ÇA, MAUN, GDFM, AG), pp. 923–932.
- CIKM-2018-ChenWH #network #predict
- Incorporating Corporation Relationship via Graph Convolutional Neural Networks for Stock Price Prediction (YC, ZW, XH), pp. 1655–1658.
- CIKM-2018-ChuLXPLR0Z #e-commerce #optimisation #ranking
- Deep Graph Embedding for Ranking Optimization in E-commerce (CC, ZL, BX, FP, CL, RR, QL0, JZ), pp. 2007–2015.
- CIKM-2018-DingTZ #generative #learning
- Semi-supervised Learning on Graphs with Generative Adversarial Nets (MD, JT, JZ), pp. 913–922.
- CIKM-2018-DingZB0 #privacy #scalability
- Privacy-Preserving Triangle Counting in Large Graphs (XD, XZ, ZB, HJ0), pp. 1283–1292.
- CIKM-2018-GuanJWC #network
- Shared Embedding Based Neural Networks for Knowledge Graph Completion (SG, XJ, YW, XC), pp. 247–256.
- CIKM-2018-HeimannSSK #named #representation
- REGAL: Representation Learning-based Graph Alignment (MH, HS, TS, DK), pp. 117–126.
- CIKM-2018-HooiAEPJPF #detection #locality #named #online
- ChangeDAR: Online Localized Change Detection for Sensor Data on a Graph (BH, LA, DE, AP, MJ, LTP, CF), pp. 507–516.
- CIKM-2018-HusseinYC
- Are Meta-Paths Necessary?: Revisiting Heterogeneous Graph Embeddings (RH, DY, PCM), pp. 437–446.
- CIKM-2018-LeL #multi #similarity
- Multiperspective Graph-Theoretic Similarity Measure (DDL, HWL), pp. 1223–1232.
- CIKM-2018-LiuCYZLS #detection #network
- Heterogeneous Graph Neural Networks for Malicious Account Detection (ZL, CC, XY, JZ, XL, LS), pp. 2077–2085.
- CIKM-2018-LosterNEF #named
- CurEx: A System for Extracting, Curating, and Exploring Domain-Specific Knowledge Graphs from Text (ML, FN, JE, BF), pp. 1883–1886.
- CIKM-2018-NikolentzosV #kernel
- Enhancing Graph Kernels via Successive Embeddings (GN, MV), pp. 1583–1586.
- CIKM-2018-OhSL #learning #multi
- Knowledge Graph Completion by Context-Aware Convolutional Learning with Multi-Hop Neighborhoods (BO, SS, KHL), pp. 257–266.
- CIKM-2018-PapineniW
- A Dynamical System on Bipartite Graphs (KP, PW), pp. 1479–1482.
- CIKM-2018-SongZWTZJC #learning #named #rank
- TGNet: Learning to Rank Nodes in Temporal Graphs (QS, BZ, YW, LAT, HZ, GJ, HC), pp. 97–106.
- CIKM-2018-VazirgiannisMN #information retrieval #mining #named
- GraphRep: Boosting Text Mining, NLP and Information Retrieval with Graphs (MV, FDM, GN), pp. 2295–2296.
- CIKM-2018-WangYWJZZW #data mining #mining #named #scalability
- AceKG: A Large-scale Knowledge Graph for Academic Data Mining (RW, YY, JW, YJ, YZ, WZ0, XW), pp. 1487–1490.
- CIKM-2018-WangZWZLXG #named #recommendation
- RippleNet: Propagating User Preferences on the Knowledge Graph for Recommender Systems (HW, FZ, JW, MZ, WL, XX, MG), pp. 417–426.
- CIKM-2018-WuZA #classification #learning
- A Quest for Structure: Jointly Learning the Graph Structure and Semi-Supervised Classification (XW, LZ, LA), pp. 87–96.
- CIKM-2018-ZhangLNLX #multi #network
- Multiresolution Graph Attention Networks for Relevance Matching (TZ, BL, DN, KL, YX), pp. 933–942.
- ECIR-2018-ZhangWXLS #precise #predict
- Discriminative Path-Based Knowledge Graph Embedding for Precise Link Prediction (MZ, QW, WX, WL, SS), pp. 276–288.
- ICML-2018-AgrawalUB #modelling #scalability
- Minimal I-MAP MCMC for Scalable Structure Discovery in Causal DAG Models (RA, CU, TB), pp. 89–98.
- ICML-2018-BacciuEM #approach #generative #markov
- Contextual Graph Markov Model: A Deep and Generative Approach to Graph Processing (DB, FE, AM), pp. 304–313.
- ICML-2018-BargiacchiVRNH #coordination #learning #multi #problem
- Learning to Coordinate with Coordination Graphs in Repeated Single-Stage Multi-Agent Decision Problems (EB, TV, DMR, AN, HvH), pp. 491–499.
- ICML-2018-BojchevskiSZG #generative #named #random
- NetGAN: Generating Graphs via Random Walks (AB, OS, DZ, SG), pp. 609–618.
- ICML-2018-CalandrielloKLV #learning #scalability
- Improved Large-Scale Graph Learning through Ridge Spectral Sparsification (DC, IK, AL, MV), pp. 687–696.
- ICML-2018-ChenZS #network #probability #reduction
- Stochastic Training of Graph Convolutional Networks with Variance Reduction (JC, JZ0, LS), pp. 941–949.
- ICML-2018-DaiKDSS #algorithm #learning
- Learning Steady-States of Iterative Algorithms over Graphs (HD, ZK, BD, AJS, LS), pp. 1114–1122.
- ICML-2018-DaiLTHWZS
- Adversarial Attack on Graph Structured Data (HD, HL, TT0, XH, LW, JZ0, LS), pp. 1123–1132.
- ICML-2018-DouikH #clustering #matrix #optimisation #probability #rank
- Low-Rank Riemannian Optimization on Positive Semidefinite Stochastic Matrices with Applications to Graph Clustering (AD, BH), pp. 1298–1307.
- ICML-2018-JinBJ #generative
- Junction Tree Variational Autoencoder for Molecular Graph Generation (WJ, RB, TSJ), pp. 2328–2337.
- ICML-2018-LevinRMP
- Out-of-sample extension of graph adjacency spectral embedding (KL, FRK, MWM, CEP), pp. 2981–2990.
- ICML-2018-LoukasV #approximate #scalability
- Spectrally Approximating Large Graphs with Smaller Graphs (AL, PV), pp. 3243–3252.
- ICML-2018-RaguetL #algorithm
- Cut-Pursuit Algorithm for Regularizing Nonsmooth Functionals with Graph Total Variation (HR, LL), pp. 4244–4253.
- ICML-2018-RavivTDT
- Gradient Coding from Cyclic MDS Codes and Expander Graphs (NR, RT, AD, IT), pp. 4302–4310.
- ICML-2018-Sanchez-Gonzalez #network #physics
- Graph Networks as Learnable Physics Engines for Inference and Control (ASG, NH, JTS, JM, MAR, RH, PWB), pp. 4467–4476.
- ICML-2018-XuLTSKJ #learning #network #representation
- Representation Learning on Graphs with Jumping Knowledge Networks (KX, CL, YT, TS, KiK, SJ), pp. 5449–5458.
- ICML-2018-YangKU #equivalence #learning
- Characterizing and Learning Equivalence Classes of Causal DAGs under Interventions (KDY, AK, CU), pp. 5537–5546.
- ICML-2018-YouYRHL #generative #modelling #named
- GraphRNN: Generating Realistic Graphs with Deep Auto-regressive Models (JY, RY, XR, WLH, JL), pp. 5694–5703.
ICPR-2018-AbreuFVBDNW #2d #image #modelling #segmentation- Model-based graph segmentation in 2-D fluorescence microsecopy images (AA, FXF, SV, PB, PD, BN, CW), pp. 3844–3849.
- ICPR-2018-BlumenthalDBBG #distance #edit distance #polynomial #problem
- Quasimetric Graph Edit Distance as a Compact Quadratic Assignment Problem (DBB, ÉD, SB, LB, JG), pp. 934–939.
- ICPR-2018-CuiB00JH #hybrid #kernel #learning #network
- A Deep Hybrid Graph Kernel Through Deep Learning Networks (LC, LB0, LR0, YW0, YJ0, ERH), pp. 1030–1035.
- ICPR-2018-CuradoELH18a #principle
- Semi-supervised Graph Rewiring with the Dirichlet Principle (MC, FE, MAL, ERH), pp. 2172–2177.
- ICPR-2018-Do0V #multi
- Knowledge Graph Embedding with Multiple Relation Projections (KD, TT0, SV), pp. 332–337.
- ICPR-2018-DornaikaTZ #flexibility #robust
- Robust and Flexible Graph-based Semi-supervised Embedding (FD, YET, RZ), pp. 465–470.
- ICPR-2018-FariaS #analysis #approach #image
- A Graph-based Approach for Static Ensemble Selection in Remote Sensing Image Analysis (FAF, SS), pp. 344–349.
- ICPR-2018-GengLH #novel #symmetry
- A Novel Asymmetric Embedding Model for Knowledge Graph Completion (ZG, ZL, YH), pp. 290–295.
- ICPR-2018-JawadAH
- Local Binary Patterns for Graph Characterization (MJ, FA, ERH), pp. 1241–1246.
- ICPR-2018-LiuRYXCY #image #network
- Fully convolutional network and graph-based method for co-segmentation of retinal layer on macular OCT images (YL, GR, GY, XX, XC, YY), pp. 3081–3085.
- ICPR-2018-LuoZLW #clustering #image #learning
- Graph Embedding-Based Ensemble Learning for Image Clustering (XL, LZ0, FL, BW), pp. 213–218.
- ICPR-2018-NiuS0 #learning
- Enhancing Knowledge Graph Completion with Positive Unlabeled Learning (JN, ZS, WZ0), pp. 296–301.
- ICPR-2018-Pham0V #memory management #network #predict #process
- Graph Memory Networks for Molecular Activity Prediction (TP, TT0, SV), pp. 639–644.
- ICPR-2018-QianWWL
- Convolutional Features-Based CRF Graph Matching for Tracking of Densely Packed Cells (WQ, YW, XW, ML0), pp. 1797–1802.
- ICPR-2018-RibaFLF #learning #message passing #network
- Learning Graph Distances with Message Passing Neural Networks (PR, AF0, JL0, AF), pp. 2239–2244.
- ICPR-2018-SantacruzS #distance #edit distance #generative #testing
- Graph Edit Distance Testing through Synthetic Graphs Generation (PS, FS), pp. 572–577.
- ICPR-2018-Wang0H #evolution
- Directed Graph Evolution from Euler-Lagrange Dynamics (JW, RCW0, ERH), pp. 448–453.
- ICPR-2018-XiaoDYLZW #adaptation #probability
- Probabilistic Graph Embedding for Unsupervised Domain Adaptation (PX, BD, SY, XL, YZ, JW0), pp. 1283–1288.
- ICPR-2018-YeDW #classification
- Graph-based Semi-supervised Classification with CRF and RNN (ZY, YD, FW), pp. 403–408.
- ICPR-2018-ZhangJCXP #approach #kernel #learning #network
- Kernel-Weighted Graph Convolutional Network: A Deep Learning Approach for Traffic Forecasting (QZ, QJ, JC, SX, CP), pp. 1018–1023.
- ICPR-2018-ZhouXZH #higher-order #multi #online
- Online Multi-Target Tracking with Tensor-Based High-Order Graph Matching (ZZ, JX, MZ, WH), pp. 1809–1814.
- ICPR-2018-ZhuMT #kernel #multi #retrieval
- Multi-Kernel Supervised Hashing with Graph Regularization for Cross-Modal Retrieval (MZ, HM, JT), pp. 2717–2722.
- ICPR-2018-ZhuX #approximate #learning #scalability
- Scalable Semi-Supervised Learning by Graph Construction with Approximate Anchors Embedding (HZ, MX), pp. 1331–1336.
- KDD-2018-ChenLZK #how
- How LinkedIn Economic Graph Bonds Information and Product: Applications in LinkedIn Salary (XC, YL, LZ, KK), pp. 120–129.
- KDD-2018-Cohen-SteinerKS #approximate
- Approximating the Spectrum of a Graph (DCS, WK, CS, GV), pp. 1263–1271.
- KDD-2018-Dong #challenge
- Challenges and Innovations in Building a Product Knowledge Graph (XLD), p. 2869.
- KDD-2018-DuT #equation #mining #named #performance
- FASTEN: Fast Sylvester Equation Solver for Graph Mining (BD, HT), pp. 1339–1347.
- KDD-2018-EswaranFGM #detection #named #streaming
- SpotLight: Detecting Anomalies in Streaming Graphs (DE, CF, SG, NM), pp. 1378–1386.
- KDD-2018-GaoWJ #network #scalability
- Large-Scale Learnable Graph Convolutional Networks (HG, ZW, SJ), pp. 1416–1424.
- KDD-2018-LeeRK #classification #using
- Graph Classification using Structural Attention (JBL, RAR, XK), pp. 1666–1674.
- KDD-2018-LiHZ #predict
- E-tail Product Return Prediction via Hypergraph-based Local Graph Cut (JL, JH, YZ), pp. 519–527.
- KDD-2018-LiuZZLYWY #interactive #proximity #semantics
- Interactive Paths Embedding for Semantic Proximity Search on Heterogeneous Graphs (ZL, VWZ, ZZ, ZL, HY, MW, JY), pp. 1860–1869.
- KDD-2018-Park0 #effectiveness #named #performance #scalability
- EvoGraph: An Effective and Efficient Graph Upscaling Method for Preserving Graph Properties (HP, MSK0), pp. 2051–2059.
- KDD-2018-ShenYXEBW0 #mobile #scalability
- Mobile Access Record Resolution on Large-Scale Identifier-Linkage Graphs (XS, HY, WX, ME, JB, ZW, CW0), pp. 886–894.
- KDD-2018-TsitsulinMKBM #named
- NetLSD: Hearing the Shape of a Graph (AT, DM, PK, AMB, EM), pp. 2347–2356.
- KDD-2018-WuZW #on the #using
- On Discrimination Discovery and Removal in Ranked Data using Causal Graph (YW, LZ0, XW), pp. 2536–2544.
- KDD-2018-YingHCEHL #network #recommendation
- Graph Convolutional Neural Networks for Web-Scale Recommender Systems (RY, RH, KC, PE, WLH, JL), pp. 974–983.
- KDD-2018-ZugnerAG #network
- Adversarial Attacks on Neural Networks for Graph Data (DZ, AA, SG), pp. 2847–2856.
ECOOP-2018-GrechKS #analysis #performance #string- Efficient Reflection String Analysis via Graph Coloring (NG, GK, YS), p. 25.
OOPSLA-2018-ZhangYBKSA #domain-specific language #named- GraphIt: a high-performance graph DSL (YZ, MY, RB, SK, JS, SPA), p. 30.
- PLDI-2018-DathathriGHDBDS #distributed #named
- Gluon: a communication-optimizing substrate for distributed heterogeneous graph analytics (RD, GG, LH, HVD, AB, ND, MS, KP), pp. 752–768.
- ASE-2018-GharibiTL #automation #generative #named #python #source code
- Code2graph: automatic generation of static call graphs for Python source code (GG, RT, YL), pp. 880–883.
- ASE-2018-HabibP #documentation #learning #thread #using
- Is this class thread-safe? inferring documentation using graph-based learning (AH, MP), pp. 41–52.
- ESEC-FSE-2018-Zhou #debugging
- Intelligent bug fixing with software bug knowledge graph (CZ), pp. 944–947.
- ICSE-2018-KrieterTSSS
- Propagating configuration decisions with modal implication graphs (SK, TT, SS, RS, GS), pp. 898–909.
- ICSE-2018-SemerathNV #automation #consistency #generative #modelling
- A graph solver for the automated generation of consistent domain-specific models (OS, ASN, DV), pp. 969–980.
- ASPLOS-2018-SabetQ0 #named
- Tigr: Transforming Irregular Graphs for GPU-Friendly Graph Processing (AHNS, JQ, ZZ0), pp. 622–636.
- ASPLOS-2018-ZhangWZQHC #named #novel
- Wonderland: A Novel Abstraction-Based Out-Of-Core Graph Processing System (MZ, YW, YZ, XQ, CH, KC), pp. 608–621.
- CASE-2018-YangH #multi #on the
- On a class of multi-input laplacian controllable graphs (PYY, SPH), pp. 310–315.
- CGO-2018-0003LJZW #concurrent #debugging #distributed #scalability
- Scalable concurrency debugging with distributed graph processing (LZ0, XL, HJ0, JZ, QW), pp. 188–199.
- CGO-2018-DavisSO #data flow #metaprogramming
- Transforming loop chains via macro dataflow graphs (ECD, MMS, CO), pp. 265–277.
- FASE-2018-BurSVV #cyber-physical #distributed #monitoring #query #runtime
- Distributed Graph Queries for Runtime Monitoring of Cyber-Physical Systems (MB, GS, AV0, DV), pp. 111–128.
CAV-2018-ArndtJKMN #exclamation #java #pointer #source code #verification- Let this Graph Be Your Witness! - An Attestor for Verifying Java Pointer Programs (HA, CJ, JPK, CM, TN0), pp. 3–11.
- CAV-2018-ChatterjeeHLOT #algorithm #markov #process
- Symbolic Algorithms for Graphs and Markov Decision Processes with Fairness Objectives (KC, MH, VL, SO, VT), pp. 178–197.
TAP-2018-HerdaTB #data flow #dependence #testing #using #verification- Using Dependence Graphs to Assist Verification and Testing of Information-Flow Properties (MH, SST, BB), pp. 83–102.
- EDM-2017-GrawemeyerWSHMP #learning #modelling #student #using
- Using Graph-based Modelling to explore changes in students' affective states during exploratory learning tasks (BG, AW, SGS, WH, MM, AP).
- EDM-2017-LynchBXG #data mining #education #mining
- Graph-based Educational Data Mining (CL, TB, LX, NG).
- ICSME-2017-GoonetillekeMB #data transformation #dependence #evolution #multi
- Graph Data Management of Evolving Dependency Graphs for Multi-versioned Codebases (OG, DM, BB), pp. 574–583.
- SANER-2017-ZhaoXKSLL #named
- HDSKG: Harvesting domain specific knowledge graph from content of webpages (XZ, ZX, MAK, NS, JL0, SWL), pp. 56–67.
- CIAA-2017-BjorklundBE #on the #order
- On the Regularity and Learnability of Ordered DAG Languages (HB, JB, PE), pp. 27–39.
- DLT-2017-Kitaev #formal method
- A Comprehensive Introduction to the Theory of Word-Representable Graphs (SK), pp. 36–67.
Haskell-2017-Mokhov #algebra #functional- Algebraic graphs with class (functional pearl) (AM), pp. 2–13.
- FDG-2017-Abuzuraiq #clustering #constraints #generative #morphism #on the #using
- On using graph partitioning with isomorphism constraint in procedural content generation (AMA), p. 10.
- FDG-2017-MazeikaW #3d #generative #modelling #named
- Solusforge: controlling the generation of the 3D models with spatial relation graphs (JM, JW), p. 4.
- FDG-2017-MurrayMW #interactive #using
- Proposal for analyzing player emotions in an interactive narrative using story intention graphs (JTM, MM, NWF), p. 4.
- CIKM-2017-CaoZL #approach #approximate #distributed #effectiveness #mining #named #scalability
- PMS: an Effective Approximation Approach for Distributed Large-scale Graph Data Processing and Mining (YC, YZ, JL), pp. 1999–2002.
- CIKM-2017-CavallariZCCC #community #detection #learning
- Learning Community Embedding with Community Detection and Node Embedding on Graphs (SC, VWZ, HC, KCCC, EC), pp. 377–386.
- CIKM-2017-GaurBB #query #using
- Tracking the Impact of Fact Deletions on Knowledge Graph Queries using Provenance Polynomials (GG, SJB, AB0), pp. 2079–2082.
- CIKM-2017-Han0YZ #approach #assembly #keyword #query #rdf
- Keyword Search on RDF Graphs - A Query Graph Assembly Approach (SH, LZ0, JXY, DZ0), pp. 227–236.
- CIKM-2017-HuangCXCZ0 #ontology #perspective #visualisation
- Ontology-based Graph Visualization for Summarized View (XH0, BC, JX, WKC, YZ, JL0), pp. 2115–2118.
- CIKM-2017-HuangZLLZH #identification #named
- KIEM: A Knowledge Graph based Method to Identify Entity Morphs (LH, LZ, SL, FL, YZ, SH), pp. 2111–2114.
- CIKM-2017-HuCHFL #nondeterminism #on the
- On Embedding Uncertain Graphs (JH, RC, ZH0, YF, SL), pp. 157–166.
- CIKM-2017-HuPJL #classification #network
- Graph Ladder Networks for Network Classification (RH, SP, JJ0, GL), pp. 2103–2106.
- CIKM-2017-KansalS #database #scalability
- A Scalable Graph-Coarsening Based Index for Dynamic Graph Databases (AK, FS), pp. 207–216.
- CIKM-2017-KozawaAK #clustering #parallel
- GPU-Accelerated Graph Clustering via Parallel Label Propagation (YK, TA, HK), pp. 567–576.
- CIKM-2017-LiCM #pattern matching
- Relaxing Graph Pattern Matching With Explanations (JL, YC0, SM0), pp. 1677–1686.
- CIKM-2017-LiCY #learning #recommendation
- Learning Graph-based Embedding For Time-Aware Product Recommendation (YL, WC, HY), pp. 2163–2166.
- CIKM-2017-MaHLSYLR #analysis #clustering #multi
- Multi-view Clustering with Graph Embedding for Connectome Analysis (GM, LH0, CTL, WS, PSY, ADL, ABR), pp. 127–136.
- CIKM-2017-Moon0S #learning
- Learning Entity Type Embeddings for Knowledge Graph Completion (CM, PJ0, NFS), pp. 2215–2218.
- CIKM-2017-NamakiWSLG
- Discovering Graph Temporal Association Rules (MHN, YW, QS, PL, TG), pp. 1697–1706.
- CIKM-2017-PalU #correlation
- Enhancing Knowledge Graph Completion By Embedding Correlations (SP, JU), pp. 2247–2250.
- CIKM-2017-RongC #dependence
- Minimizing Dependence between Graphs (YR, HC), pp. 1827–1836.
- CIKM-2017-SathanurCJP #network #simulation
- When Labels Fall Short: Property Graph Simulation via Blending of Network Structure and Vertex Attributes (AVS, SC, CAJ, SP), pp. 2287–2290.
- CIKM-2017-SeoK #algorithm #clustering #named #performance #scalability
- pm-SCAN: an I/O Efficient Structural Clustering Algorithm for Large-scale Graphs (JHS, MHK), pp. 2295–2298.
- CIKM-2017-ShiGQZ
- Knowledge Graph Embedding with Triple Context (JS, HG, GQ, ZZ), pp. 2299–2302.
- CIKM-2017-SrivastavaD #retrieval #semantics #similarity
- Soft Seeded SSL Graphs for Unsupervised Semantic Similarity-based Retrieval (AS, MD), pp. 2315–2318.
- CIKM-2017-TanZW #learning #representation #scalability
- Representation Learning of Large-Scale Knowledge Graphs via Entity Feature Combinations (ZT, XZ0, WW0), pp. 1777–1786.
- CIKM-2017-TayTPH #multi #network #predict
- Multi-Task Neural Network for Non-discrete Attribute Prediction in Knowledge Graphs (YT, LAT, MCP, SCH), pp. 1029–1038.
- CIKM-2017-WangCL #twitter #using
- Using Knowledge Graphs to Explain Entity Co-occurrence in Twitter (YW, MJC, YFL), pp. 2351–2354.
- CIKM-2017-WangPLZJ #clustering #named
- MGAE: Marginalized Graph Autoencoder for Graph Clustering (CW, SP, GL, XZ, JJ0), pp. 889–898.
- CIKM-2017-WangQPZX #semantics
- Semantic Annotation for Places in LBSN through Graph Embedding (YW, ZQ, JP0, YZ0, JX), pp. 2343–2346.
- CIKM-2017-XuWXQ #classification #network #recursion
- Attentive Graph-based Recursive Neural Network for Collective Vertex Classification (QX, QW, CX, LQ), pp. 2403–2406.
- CIKM-2017-YangWLZL #network
- From Properties to Links: Deep Network Embedding on Incomplete Graphs (DY, SW, CL, XZ0, ZL), pp. 367–376.
- CIKM-2017-ZhangH #ambiguity #network #using
- Name Disambiguation in Anonymized Graphs using Network Embedding (BZ, MAH), pp. 1239–1248.
- CIKM-2017-ZhangXKZ #interactive #learning
- Learning Node Embeddings in Interaction Graphs (YZ, YX, XK, YZ), pp. 397–406.
- CIKM-2017-ZhengC0YZ #natural language
- Natural Language Question/Answering: Let Users Talk With The Knowledge Graph (WZ, HC, LZ0, JXY, KZ), pp. 217–226.
- ECIR-2017-GangulyP #named #representation
- Paper2vec: Combining Graph and Text Information for Scientific Paper Representation (SG, VP), pp. 383–395.
- ICML-2017-FeldmanOR #network #summary
- Coresets for Vector Summarization with Applications to Network Graphs (DF, SO, DR), pp. 1117–1125.
- ICML-2017-HornakovaLA #analysis #multi #optimisation
- Analysis and Optimization of Graph Decompositions by Lifted Multicuts (AH, JHL, BA), pp. 1539–1548.
- ICML-2017-KhasanovaF #invariant #learning #representation
- Graph-based Isometry Invariant Representation Learning (RK, PF), pp. 1847–1856.
- ICML-2017-KocaogluDV #learning
- Cost-Optimal Learning of Causal Graphs (MK, AD, SV), pp. 1875–1884.
- ICML-2017-LeeHGJC #random
- Bayesian inference on random simple graphs with power law degree distributions (JL, CH, ZG, LFJ, SC), pp. 2004–2013.
- ICML-2017-LeiJBJ #architecture #kernel #sequence
- Deriving Neural Architectures from Sequence and Graph Kernels (TL0, WJ, RB, TSJ), pp. 2024–2033.
- ICML-2017-TrivediDWS #named #reasoning
- Know-Evolve: Deep Temporal Reasoning for Dynamic Knowledge Graphs (RT, HD, YW0, LS), pp. 3462–3471.
- KDD-2017-ChoiBSSS #learning #named #representation
- GRAM: Graph-based Attention Model for Healthcare Representation Learning (EC, MTB, LS, WFS, JS), pp. 787–795.
- KDD-2017-MalloyBAKJ #internet
- Internet Device Graphs (MM, PB, ECA, JK, AJ), pp. 1913–1921.
- KDD-2017-TillmanMBG
- Construction of Directed 2K Graphs (BT, AM, CTB, MG), pp. 1115–1124.
- KDD-2017-YinBLG #clustering #higher-order
- Local Higher-Order Graph Clustering (HY, ARB, JL, DFG), pp. 555–564.
- KDD-2017-ZhangWLTL #clustering #heuristic
- Graph Edge Partitioning via Neighborhood Heuristic (CZ, FW, QL, ZGT, ZL), pp. 605–614.
- KDD-2017-ZhangWP #visualisation
- Visualizing Attributed Graphs via Terrain Metaphor (YZ, YW, SP0), pp. 1325–1334.
- KDD-2017-ZhouZYATDH #algorithm
- A Local Algorithm for Structure-Preserving Graph Cut (DZ, SZ, MYY, SA, HT, HD, JH), pp. 655–664.
ICMT-2017-SemerathV #constraints #evaluation #modelling- Graph Constraint Evaluation over Partial Models by Constraint Rewriting (OS, DV), pp. 138–154.
- OOPSLA-2017-PapadakisB0AH #named
- Seam: provably safe local edits on graphs (MP, GLB, RS0, AA, PH), p. 29.
AdaEurope-2017-MedinaBP #scheduling- Directed Acyclic Graph Scheduling for Mixed-Criticality Systems (RM0, EB, LP), pp. 217–232.
- AdaEurope-2017-MohaqeqiA0 #ada #execution #semantics
- An Executable Semantics for Synchronous Task Graphs: From SDRT to Ada (MM, JA, WY0), pp. 137–152.
- ESEC-FSE-2017-MaAXLZLZ #algorithm #machine learning #named
- LAMP: data provenance for graph based machine learning algorithms through derivative computation (SM, YA, ZX, WCL, JZ, YL, XZ0), pp. 786–797.
- ESEC-FSE-2017-YuanXXPZ #android #execution #named
- RunDroid: recovering execution call graphs for Android applications (YY, LX, XX, AP, HZ), pp. 949–953.
- ASPLOS-2017-VoraGX #approximate #named #performance #streaming
- KickStarter: Fast and Accurate Computations on Streaming Graphs via Trimmed Approximations (KV, RG0, G(X), pp. 237–251.
- ASPLOS-2017-VoraTGH #distributed #named
- CoRAL: Confined Recovery in Distributed Asynchronous Graph Processing (KV, CT0, RG0, ZH), pp. 223–236.
- ASPLOS-2017-WangHZXS #analysis #interprocedural #named #scalability
- Graspan: A Single-machine Disk-based Graph System for Interprocedural Static Analyses of Large-scale Systems Code (KW0, AH0, ZZ0, G(X, AAS), pp. 389–404.
- CASE-2017-0013YG #image #optimisation #using
- Accurate image mosaicing for bridge deck using graph optimization with GPS data (FL0, JY, NG), pp. 1090–1095.
- CASE-2017-HeLG #optimisation
- Optimization of deterministic timed weighted marked graphs (ZH, ZL, AG), pp. 956–957.
- CASE-2017-WuWW #algorithm #estimation #multi
- A t-level driven search for estimation of distribution algorithm in solving task graph allocation to multiprocessors (CW, LW0, JW), pp. 630–635.
- FASE-2017-SchneiderLO #generative
- Symbolic Model Generation for Graph Properties (SS0, LL, FO), pp. 226–243.
CSL-2017-Grussien #polynomial- Capturing Logarithmic Space and Polynomial Time on Chordal Claw-Free Graphs (BG), p. 19.
CSEET-2016-WeiDCS #concept #education #framework #modelling #requirements #uml- A Conceptual Graphs Framework for Teaching UML Model-Based Requirements Acquisition (BW, HSD, EC, CS), pp. 71–75.
- EDM-2016-ChaplotYCK #automation #data-driven #induction
- Data-driven Automated Induction of Prerequisite Structure Graphs (DSC, YY, JGC, KRK), pp. 318–323.
- EDM-2016-ChenGT #modelling #student
- Joint Discovery of Skill Prerequisite Graphs and Student Models (YC, JPGB, JT0), pp. 46–53.
- EDM-2016-JiangG #approach #contest #mining #on the
- On Competition for Undergraduate Co-op Placements: A Graph Mining Approach (YHJ, LG), pp. 394–399.
- SCAM-2016-LossingGI #c #compilation #concept #dependence #text-to-text
- Effects Dependence Graph: A Key Data Concept for C Source-to-Source Compilers (NL, PG, FI), pp. 167–176.
- SCAM-2016-MuscoMP #fault #locality
- Mutation-Based Graph Inference for Fault Localization (VM, MM, PP), pp. 97–106.
- DLT-2016-Duck #automaton #infinity #logic
- Weighted Automata and Logics on Infinite Graphs (SD), pp. 151–163.
- Haskell-2016-DexterLC #haskell #lazy evaluation
- Lazy graph processing in Haskell (PD, YDL, KC), pp. 182–192.
- ICFP-2016-EmotoMHMI #domain-specific language #exclamation #functional
- Think like a vertex, behave like a function! a functional DSL for vertex-centric big graph processing (KE, KM, ZH, AM, HI), pp. 200–213.
- CIKM-2016-AguinagaPCW #graph grammar
- Growing Graphs from Hyperedge Replacement Graph Grammars (SA, RP, DC0, TW), pp. 469–478.
- CIKM-2016-AlabdulmohsinHS #detection
- Content-Agnostic Malware Detection in Heterogeneous Malicious Distribution Graph (IMA, YH, YS, XZ0), pp. 2395–2400.
- CIKM-2016-Balaneshinkordan #concept #query #using
- Sequential Query Expansion using Concept Graph (SB, AK), pp. 155–164.
- CIKM-2016-BandyopadhyayFC #incremental #scalability #sketching
- Topological Graph Sketching for Incremental and Scalable Analytics (BB, DF, AC, SP0), pp. 1231–1240.
- CIKM-2016-ChenLYWLZ #keyword #multi #performance #query
- Efficient Batch Processing for Multiple Keyword Queries on Graph Data (LC, CL, XY0, BW0, JL, RZ0), pp. 1261–1270.
- CIKM-2016-ChodpathumwanAT #database #independence #representation #similarity #towards
- Towards Representation Independent Similarity Search Over Graph Databases (YC, AA, AT, YS), pp. 2233–2238.
- CIKM-2016-EtemadiLT #estimation #performance #scalability
- Efficient Estimation of Triangles in Very Large Graphs (RE, JL, YHT), pp. 1251–1260.
- CIKM-2016-HoLSKDWZS #algorithm #behaviour #distributed #scalability
- A Distributed Graph Algorithm for Discovering Unique Behavioral Groups from Large-Scale Telco Data (QH, WL, ES, SK, TAD, JW, ICZ, ASN), pp. 1353–1362.
- CIKM-2016-HuangSLMH #data transformation #named
- TGraph: A Temporal Graph Data Management System (HH, JS, XL, SM0, JH), pp. 2469–2472.
- CIKM-2016-HuWCLF #query #scalability
- Querying Minimal Steiner Maximum-Connected Subgraphs in Large Graphs (JH, XW, RC, SL, YF), pp. 1241–1250.
- CIKM-2016-JoHJBK #locality
- Data Locality in Graph Engines: Implications and Preliminary Experimental Results (YYJ, JH, MHJ, JGB, SWK), pp. 1885–1888.
- CIKM-2016-KangPYC #recommendation
- Top-N Recommendation on Graphs (ZK, CP, MY, QC), pp. 2101–2106.
- CIKM-2016-KargarGS #effectiveness #keyword #named
- eGraphSearch: Effective Keyword Search in Graphs (MK, LG, JS), pp. 2461–2464.
- CIKM-2016-KimXO #composition #incremental #probability
- Probabilistic Knowledge Graph Construction: Compositional and Incremental Approaches (DK0, LX, CSO), pp. 2257–2262.
- CIKM-2016-LiakosPD #distributed #novel
- Memory-Optimized Distributed Graph Processing through Novel Compression Techniques (PL, KP, AD), pp. 2317–2322.
- CIKM-2016-LiCL #approximate #query #using
- Approximating Graph Pattern Queries Using Views (JL, YC0, XL), pp. 449–458.
- CIKM-2016-LiuZCC #detection #statistics #topic
- Graph Topic Scan Statistic for Spatial Event Detection (YL, BZ, FC0, DWC), pp. 489–498.
- CIKM-2016-LiuZGF #adaptation #named #online
- GiraphAsync: Supporting Online and Offline Graph Processing via Adaptive Asynchronous Message Processing (YL, CZ, JG, ZF), pp. 479–488.
- CIKM-2016-VesdapuntG #api #social
- Updating an Existing Social Graph Snapshot via a Limited API (NV, HGM), pp. 1693–1702.
- CIKM-2016-WangWZ #distributed #partial evaluation #performance #query #rdf #using
- Efficient Distributed Regular Path Queries on RDF Graphs Using Partial Evaluation (XW0, JW, XZ), pp. 1933–1936.
- CIKM-2016-XieYWXCW #learning #recommendation
- Learning Graph-based POI Embedding for Location-based Recommendation (MX, HY, HW, FX, WC, SW), pp. 15–24.
- CIKM-2016-ZhengW #learning #multi
- Graph-Based Multi-Modality Learning for Clinical Decision Support (ZZ, XW0), pp. 1945–1948.
- ECIR-2016-AkerKBPBHG #approach #clustering #online #topic
- A Graph-Based Approach to Topic Clustering for Online Comments to News (AA, EK, ARB, MLP, EB, MH, RJG), pp. 15–29.
- ECIR-2016-Balaneshinkordan #comparison #empirical #query
- An Empirical Comparison of Term Association and Knowledge Graphs for Query Expansion (SB, AK), pp. 761–767.
- ECIR-2016-ChenJYYZ #modelling #probability #semantics #topic
- Probabilistic Topic Modelling with Semantic Graph (LC0, JMJ, HY, FY, HZ), pp. 240–251.
- ICML-2016-ChenKST #community #locality
- Community Recovery in Graphs with Locality (YC0, GMK, CS, DT), pp. 689–698.
- ICML-2016-CohenHK #feedback #learning #online
- Online Learning with Feedback Graphs Without the Graphs (AC, TH, TK), pp. 811–819.
- ICML-2016-NiepertAK #learning #network
- Learning Convolutional Neural Networks for Graphs (MN, MA, KK), pp. 2014–2023.
- ICML-2016-YangCS #learning
- Revisiting Semi-Supervised Learning with Graph Embeddings (ZY, WWC, RS), pp. 40–48.
- ICPR-2016-AytekinIKG #segmentation
- Salient object segmentation based on linearly combined affinity graphs (ÇA, AI, SK, MG), pp. 3769–3774.
- ICPR-2016-Bai0CH16a #matrix #novel
- A novel entropy-based graph signature from the average mixing matrix (LB0, LR0, LC, ERH), pp. 1339–1344.
- ICPR-2016-BaiCWJ0H #classification #clustering #kernel
- Shape classification with a vertex clustering graph kernel (LB0, LC, YW0, XJ0, XB0, ERH), pp. 2634–2639.
- ICPR-2016-BougleuxGB #distance #edit distance #polynomial
- Graph edit distance as a quadratic program (SB, BG, LB), pp. 1701–1706.
- ICPR-2016-GligorijevicPZ #community #detection #multi
- Fusion and community detection in multi-layer graphs (VG, YP, SZ), pp. 1327–1332.
- ICPR-2016-HouXX0 #classification #learning
- Semi-supervised learning competence of classifiers based on graph for dynamic classifier selection (CH, YX, ZX, JS0), pp. 3650–3654.
- ICPR-2016-JavedJMB #modelling
- Motion-Aware Graph Regularized RPCA for background modeling of complex scenes (SJ, SKJ, AM, TB), pp. 120–125.
- ICPR-2016-Kamkar0LPV #predict #using
- Stable clinical prediction using graph support vector machines (IK, SG0, CL0, DQP, SV), pp. 3332–3337.
- ICPR-2016-KooliB #documentation #recognition
- Inexact graph matching for entity recognition in OCRed documents (NK, AB), pp. 4071–4076.
- ICPR-2016-MiyazakiO #recognition
- Graph model boosting for structural data recognition (TM, SO), pp. 1707–1712.
- ICPR-2016-OhY #algorithm #learning
- Enhancing label inference algorithms considering vertex importance in graph-based semi-supervised learning (BO, JY), pp. 1671–1676.
- ICPR-2016-OrueG #process #recognition #using
- Face recognition using activities of directed graphs in spatial pyramid (JPMO, WNG), pp. 3162–3167.
- ICPR-2016-RaiNCD #clustering #multi #using
- Partial Multi-View Clustering using Graph Regularized NMF (NR, SN, SC, OD), pp. 2192–2197.
- ICPR-2016-Robles-KellyW #image #using
- Semi-supervised image labelling using barycentric graph embeddings (ARK, RW), pp. 1518–1523.
- ICPR-2016-WuZLMS #named #novel
- EvaToon: A novel graph matching system for evaluating cartoon drawings (YW, XZ, TL, GM, LS), pp. 1119–1124.
- ICPR-2016-YeWH #generative #using
- Analyzing graph time series using a generative model (CY, RCW0, ERH), pp. 3338–3343.
- ICPR-2016-ZhengTZW #estimation #reduction
- Maximal level estimation and unbalance reduction for graph signal downsampling (XZ, YYT, JZ0, PSPW), pp. 3922–3926.
- ICPR-2016-ZhugeHNY #clustering #feature model #using
- Unsupervised feature extraction using a learned graph with clustering structure (WZ, CH, FN, DY), pp. 3597–3602.
- KDD-2016-AkibaY #scalability #sketching
- Compact and Scalable Graph Neighborhood Sketching (TA, YY), pp. 685–694.
- KDD-2016-DhulipalaKKOPS #recursion
- Compressing Graphs and Indexes with Recursive Graph Bisection (LD, IK, BK, GO, SP, AS), pp. 1535–1544.
- KDD-2016-HooiSBSSF #bound #named
- FRAUDAR: Bounding Graph Fraud in the Face of Camouflage (BH, HAS, AB, NS, KS, CF), pp. 895–904.
- KDD-2016-MaccioniA #pattern matching #scalability
- Scalable Pattern Matching over Compressed Graphs via Dedensification (AM, DJA), pp. 1755–1764.
- KDD-2016-ManzoorMA #detection #performance #streaming
- Fast Memory-efficient Anomaly Detection in Streaming Heterogeneous Graphs (EAM, SMM, LA), pp. 1035–1044.
- KDD-2016-NandiMADB #control flow #detection #execution #mining #using
- Anomaly Detection Using Program Control Flow Graph Mining From Execution Logs (AN, AM, SA, GBD, SB), pp. 215–224.
- KDD-2016-OuCPZ0 #symmetry #transitive
- Asymmetric Transitivity Preserving Graph Embedding (MO, PC0, JP, ZZ, WZ0), pp. 1105–1114.
- KDD-2016-RiondatoU #approximate #named
- ABRA: Approximating Betweenness Centrality in Static and Dynamic Graphs with Rademacher Averages (MR, EU), pp. 1145–1154.
- KDD-2016-SilvaDBSS
- Graph Wavelets via Sparse Cuts (AS, XHD, PB, AKS, AS), pp. 1175–1184.
- KDD-2016-WangNH #clustering #matrix #probability
- Structured Doubly Stochastic Matrix for Graph Based Clustering: Structured Doubly Stochastic Matrix (XW, FN, HH), pp. 1245–1254.
- KDD-2016-ZhangLG #approximate #personalisation #rank
- Approximate Personalized PageRank on Dynamic Graphs (HZ, PL, AG), pp. 1315–1324.
- ICMT-2016-StrueberPA #clone detection #detection #model transformation #transformation language
- Clone Detection for Graph-Based Model Transformation Languages (DS, JP, VA), pp. 191–206.
- MoDELS-2016-Garcia-Dominguez #integration #modelling #tool support
- Integration of a graph-based model indexer in commercial modelling tools (AGD, KB, DSK, MAAdS, AA, AB), pp. 340–350.
- MoDELS-2016-SzarnyasKSV #evaluation #metric #modelling #multi #towards
- Towards the characterization of realistic models: evaluation of multidisciplinary graph metrics (GS, ZK, ÁS, DV), pp. 87–94.
- ECOOP-2016-HarkesGV #incremental #named #persistent
- IceDust: Incremental and Eventual Computation of Derived Values in Persistent Object Graphs (DH, DMG, EV), p. 26.
- OOPSLA-2016-PaiP #algorithm #compilation #optimisation #throughput
- A compiler for throughput optimization of graph algorithms on GPUs (SP, KP), pp. 1–19.
- OOPSLA-2016-PetrashkoULO #morphism #parametricity #polymorphism
- Call graphs for languages with parametric polymorphism (DP, VU, OL, MO), pp. 394–409.
- AdaEurope-2016-MohaqeqiAY #analysis #data flow #modelling #realtime #using
- Modeling and Analysis of Data Flow Graphs Using the Digraph Real-Time Task Model (MM, JA, WY0), pp. 15–29.
PEPM-2016-AntwerpenNTVW #analysis #constraints #semantics- A constraint language for static semantic analysis based on scope graphs (HvA, PN, APT, EV, GW), pp. 49–60.
SAS-2016-GharatKM #analysis #points-to #using- Flow- and Context-Sensitive Points-To Analysis Using Generalized Points-To Graphs (PMG, UPK, AM), pp. 212–236.
- ASE-2016-Mougouei #dependence #integer #programming #requirements #using
- Factoring requirement dependencies in software requirement selection using graphs and integer programming (DM), pp. 884–887.
FSE-2016-ReifEHLM #java #library- Call graph construction for Java libraries (MR, ME, BH, JL, MM), pp. 474–486.
- CASE-2016-SyJDD #clustering #detection
- Graph-based clustering for detecting frequent patterns in event log data (ES, SAJ, AD, YD0), pp. 972–977.
- CC-2016-NgY #concurrent #detection #synthesis
- Static deadlock detection for concurrent go by global session graph synthesis (NN, NY), pp. 174–184.
- CGO-2016-NguyenL #multi #platform
- Communication-aware mapping of stream graphs for multi-GPU platforms (DN0, JL), pp. 94–104.
- FASE-2016-CorrodiHP #concurrent #semantics #source code
- A Graph-Based Semantics Workbench for Concurrent Asynchronous Programs (CC, AH, CMP), pp. 31–48.
- FASE-2016-WangLW #co-evolution
- The Influences of Edge Instability on Change Propagation and Connectivity in Call Graphs (LW, HL, XW), pp. 197–213.
- CAV-2016-SevegnaniC #analysis #named
- BigraphER: Rewriting and Analysis Engine for Bigraphs (MS, MC), pp. 494–501.
- CSL-2016-EickmeyerK #first-order #invariant #logic
- Successor-Invariant First-Order Logic on Graphs with Excluded Topological Subgraphs (KE, KiK), p. 15.
- CSL-2016-Elberfeld
- Context-Free Graph Properties via Definable Decompositions (ME), p. 16.
IJCAR-2016-DochertyP #logic- Intuitionistic Layered Graph Logic (SD, DJP), pp. 469–486.
HT-2015-SongFGWCZ #microblog #word- Build Emotion Lexicon from Microblogs by Combining Effects of Seed Words and Emoticons in a Heterogeneous Graph (KS, SF, WG, DW, LC, CZ), pp. 283–292.
PODS-2015-GuhaMT - Vertex and Hyperedge Connectivity in Dynamic Graph Streams (SG, AM, DT), pp. 241–247.
- PODS-2015-MunroNV #data type #documentation
- Dynamic Data Structures for Document Collections and Graphs (JIM, YN, JSV), pp. 277–289.
- PODS-2015-PraveenS #how #question
- Defining Relations on Graphs: How Hard is it in the Presence of Node Partitions? (MP, BS), pp. 159–172.
SIGMOD-2015-ArmenatzoglouPN #approach #clustering #game studies #multi #realtime #social- Real-Time Multi-Criteria Social Graph Partitioning: A Game Theoretic Approach (NA, HP, VN, DP, CS), pp. 1617–1628.
- SIGMOD-2015-HuangFL
- Minimum Spanning Trees in Temporal Graphs (SH, AWCF, RL), pp. 419–430.
- SIGMOD-2015-PerezSBPRSL #interactive #named
- Ringo: Interactive Graph Analytics on Big-Memory Machines (YP, RS, AB, RP, MR, PS, JL), pp. 1105–1110.
- SIGMOD-2015-ShinJSK #approach #named #random #scalability
- BEAR: Block Elimination Approach for Random Walk with Restart on Large Graphs (KS, JJ, LS, UK), pp. 1571–1585.
- SIGMOD-2015-SunFSKHX #named #performance
- SQLGraph: An Efficient Relational-Based Property Graph Store (WS, AF, KS, AK, GH, GTX), pp. 1887–1901.
- SIGMOD-2015-YuanMYG #algorithm
- Updating Graph Indices with a One-Pass Algorithm (DY, PM, HY, CLG), pp. 1903–1916.
- SIGMOD-2015-ZhangCPSX #statistics #using
- Private Release of Graph Statistics using Ladder Functions (JZ, GC, CMP, DS, XX), pp. 731–745.
- SIGMOD-2015-ZhengZLYSZ #approach #how #nondeterminism #rdf #similarity
- How to Build Templates for RDF Question/Answering: An Uncertain Graph Similarity Join Approach (WZ, LZ, XL, JXY, SS, DZ), pp. 1809–1824.
VLDB-2015-CebiricGM #query #rdf #summary- Query-Oriented Summarization of RDF Graphs (SC, FG, IM), pp. 2012–2023.
- VLDB-2015-ChingEKLM
- One Trillion Edges: Graph Processing at Facebook-Scale (AC, SE, MK, DL, SM), pp. 1804–1815.
- VLDB-2015-ChodpathumwanAT #independence #named #representation #towards
- Universal-DB: Towards Representation Independent Graph Analytics (YC, AA, AT, YS), pp. 2016–2027.
- VLDB-2015-FanFTD
- Keys for Graphs (WF, ZF, CT, XLD), pp. 1590–1601.
- VLDB-2015-FanWWX
- Association Rules with Graph Patterns (WF, XW, YW, JX), pp. 1502–1513.
- VLDB-2015-HanD #execution #parallel
- Giraph Unchained: Barrierless Asynchronous Parallel Execution in Pregel-like Graph Processing Systems (MH, KD), pp. 950–961.
- VLDB-2015-JayaramGL #interactive #interface #named #query #visual notation
- VIIQ: Auto-Suggestion Enabled Visual Interface for Interactive Graph Query Formulation (NJ, SG, CL), pp. 1940–1951.
- VLDB-2015-KazemiHG
- Growing a Graph Matching from a Handful of Seeds (EK, SHH, MG), pp. 1010–1021.
- VLDB-2015-KhanC #modelling #nondeterminism #on the #query
- On Uncertain Graphs Modeling and Queries (AK, LC), pp. 2042–2053.
- VLDB-2015-KoutraJNF #interactive #mining #named #scalability #visualisation
- Perseus: An Interactive Large-Scale Graph Mining and Visualization Tool (DK, DJ, YN, CF), pp. 1924–1935.
- VLDB-2015-LiuLYXW #independence #set #towards
- Towards Maximum Independent Sets on Massive Graphs (YL, JL, HY, XX, ZW), pp. 2122–2133.
- VLDB-2015-MargoS #distributed #scalability
- A Scalable Distributed Graph Partitioner (DWM, MIS), pp. 1478–1489.
- VLDB-2015-MitliagkasBDC #approximate #exclamation #performance #rank
- FrogWild! — Fast PageRank Approximations on Graph Engines (IM, MB, AGD, CC), pp. 874–885.
- VLDB-2015-RenW #morphism #scalability
- Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs (XR, JW), pp. 617–628.
- VLDB-2015-ShaoC0LX #framework #performance #scalability #similarity
- An Efficient Similarity Search Framework for SimRank over Large Dynamic Graphs (YS, BC, LC, ML, XX), pp. 838–849.
- VLDB-2015-ShiokawaFO #algorithm #clustering #performance #scalability
- SCAN++: Efficient Algorithm for Finding Clusters, Hubs and Outliers on Large-scale Graphs (HS, YF, MO), pp. 1178–1189.
- VLDB-2015-SundaramSPDAV0D #effectiveness #named #performance
- GraphMat: High performance graph analytics made productive (NS, NS, MMAP, SD, MJA, SGV, DD, PD), pp. 1214–1225.
- VLDB-2015-Xirogiannopoulos #named #relational
- GraphGen: Exploring Interesting Graphs in Relational Data (KX, UK, AD), pp. 2032–2043.
- VLDB-2015-ZhangC0 #approach #distributed #set
- Bonding Vertex Sets Over Distributed Graph: A Betweenness Aware Approach (XZ, HC, LC), pp. 1418–1429.
- VLDB-2015-ZhouLLZ #named #optimisation #performance
- GraphTwist: Fast Iterative Graph Computation with Two-tier Optimizations (YZ, LL, KL, QZ), pp. 1262–1273.
- EDM-2015-JohnPM #detection #problem #question #semantics #similarity #word
- Semantic Similarity Graphs of Mathematics Word Problems: Can Terminology Detection Help? (RJLJ, RJP, TSM), pp. 452–455.
- EDM-2015-SiemensBG #learning
- Personal Knowledge/Learning Graph (GS, RSB, DG), p. 5.
- MSR-2015-SchumacherA #framework
- An Enhanced Graph-Based Infrastructure for Software Search Engines (MS, CA), pp. 386–390.
- SANER-2015-Abi-AntounWKGR #impact analysis
- Impact analysis based on a global hierarchical Object Graph (MAA, YW, EK, AG, VR), pp. 221–230.
- SANER-2015-BezemerPG #comprehension #difference #performance #using
- Understanding software performance regressions using differential flame graphs (CPB, JP, BG), pp. 535–539.
- SANER-2015-LaverdiereBM #analysis #composition #using
- Taint analysis of manual service compositions using Cross-Application Call Graphs (MAL, BJB, EM), pp. 585–589.
- SANER-2015-QiuSM #identification #library #morphism #using
- Library functions identification in binary code by using graph isomorphism testings (JQ, XS, PM), pp. 261–270.
- SANER-2015-SinghGN #data type #memory management
- MG++: Memory graphs for analyzing dynamic data structures (VS, RG, IN), pp. 291–300.
- SCAM-2015-LudemannK #control flow
- From preprocessor-constrained parse graphs to preprocessor-constrained control flow (DL, RK), pp. 211–220.
- CIAA-2015-GusevS #on the
- On the Number of Synchronizing Colorings of Digraphs (VVG, MS), pp. 127–139.
ICALP-v1-2015-0001GR #morphism- Counting Homomorphisms to Square-Free Graphs, Modulo 2 (AG, LAG, DR), pp. 642–653.
- ICALP-v1-2015-BerkholzG #algebra #morphism #testing
- Limitations of Algebraic Approaches to Graph Isomorphism Testing (CB, MG), pp. 155–166.
- ICALP-v1-2015-BernsteinS
- Fully Dynamic Matching in Bipartite Graphs (AB, CS), pp. 167–179.
- ICALP-v1-2015-DoronT #approximate #on the #probability #problem
- On the Problem of Approximating the Eigenvalues of Undirected Graphs in Probabilistic Logspace (DD, ATS), pp. 419–431.
- ICALP-v1-2015-Erlebach0K #on the
- On Temporal Graph Exploration (TE, MH, FK), pp. 444–455.
- ICALP-v1-2015-FeldmannFKP #bound
- A (1+ε ) ( 1 + ε ) -Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs (AEF, WSF, JK, IP), pp. 469–480.
- ICALP-v1-2015-FominGKM #bound #morphism #problem
- Lower Bounds for the Graph Homomorphism Problem (FVF, AG, ASK, IM), pp. 481–493.
- ICALP-v1-2015-GeorgiadisILP
- 2-Vertex Connectivity in Directed Graphs (LG, GFI, LL, NP), pp. 605–616.
- ICALP-v1-2015-HenzingerKN #algorithm #reachability
- Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs (MH, SK, DN), pp. 725–736.
- ICALP-v1-2015-KannanM0 #complexity #query
- Near-Linear Query Complexity for Graph Inference (SK, CM, HZ), pp. 773–784.
- ICALP-v1-2015-KawaseKY
- Finding a Path in Group-Labeled Graphs with Two Labels Forbidden (YK, YK, YY), pp. 797–809.
- ICALP-v2-2015-AchlioptasS #independence #symmetry
- Symmetric Graph Properties Have Independent Edges (DA, PS), pp. 467–478.
- ICALP-v2-2015-Feldmann #approximate #parametricity #problem
- Fixed Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs (AEF), pp. 588–600.
- ICALP-v2-2015-FriedrichK #on the #random
- On the Diameter of Hyperbolic Random Graphs (TF, AK), pp. 614–625.
- ICALP-v2-2015-KawarabayashiK #theorem #towards
- Towards the Graph Minor Theorems for Directed Graphs (KiK, SK), pp. 3–10.
LATA-2015-CazauxLR #assembly- Construction of a de Bruijn Graph for Assembly from a Truncated Suffix Tree (BC, TL, ER), pp. 109–120.
- LATA-2015-DabrowskiHP #bound #clique
- Bounding Clique-Width via Perfect Graphs (KKD, SH, DP), pp. 676–688.
- LATA-2015-MakowskyL #matrix #word
- Hankel Matrices: From Words to Graphs (JAM, NL), pp. 47–55.
FM-2015-ZhuYGZZZ #data flow #model checking #scheduling- Static Optimal Scheduling for Synchronous Data Flow Graphs with Model Checking (XZ, RY, YLG, JZ, WZ, GZ), pp. 551–569.
RTA-2015-Kirchner #data analysis- Port Graphs, Rules and Strategies for Dynamic Data Analytics — Extended Abstract (HK), pp. 1–4.
GaM-2015-BakFPR #interpreter #programming language- A Reference Interpreter for the Graph Programming Language GP 2 (CB, GF, DP, CR), pp. 48–64.
- GaM-2015-HeussnerPCM #concurrent #object-oriented #towards #verification
- Towards Practical Graph-Based Verification for an Object-Oriented Concurrency Model (AH, CMP, CC, BM), pp. 32–47.
- GaM-2015-HochMS #programming
- Dynamic Programming on Nominal Graphs (NH, UM, MS), pp. 80–96.
- GaM-2015-Moreau
- Aggregation by Provenance Types: A Technique for Summarising Provenance Graphs (LM), pp. 129–144.
GCM-2015-Flick #correctness #on the #recursion #source code- On Correctness of Graph Programs Relative to Recursively Nested Conditions (NEF), pp. 97–112.
- GCM-2015-PeuserH #category theory #composition
- Attribution of Graphs by Composition of M, N-adhesive Categories (CP, AH), pp. 66–81.
ICGT-2015-Bruggink0NZ #graph transformation #proving #termination #using- Proving Termination of Graph Transformation Systems Using Weighted Type Graphs over Semirings (HJSB, BK, DN, HZ), pp. 52–68.
- ICGT-2015-Horn #clojure #domain-specific language #embedded #pattern matching
- Graph Pattern Matching as an Embedded Clojure DSL (TH), pp. 189–204.
- ICGT-2015-RadkeABHT #constraints #invariant #ocl #set
- Translating Essential OCL Invariants to Nested Graph Constraints Focusing on Set Operations (HR, TA, JSB, AH, GT), pp. 155–170.
CHI-2015-CaoLLT #interactive #mining #multi #named #visual notation- g-Miner: Interactive Visual Group Mining on Multivariate Graphs (NC, YRL, LL, HT), pp. 279–288.
HIMI-IKD-2015-SharmaMMTD #modelling- A Team Hiring Solution Based on Graph-Based Modelling of Human Resource Entities (AS, JM, AM, AT, PD), pp. 115–126.
- HIMI-IKD-2015-YamashitaS #multi
- Edge Bundling in Multi-attributed Graphs (TY, RS), pp. 138–147.
ICEIS-v1-2015-BerroMT #open data #process #statistics- Graph-based ETL Processes for Warehousing Statistical Open Data (AB, IM, OT), pp. 271–278.
- ICEIS-v1-2015-FuD #named #scalability #social
- ROBE — Knitting a Tight Hub for Shortest Path Discovery in Large Social Graphs (LF, JD), pp. 97–107.
- ICEIS-v1-2015-MpindaMSR #database #simulation #using
- Graph Database Application using Neo4j — Railroad Planner Simulation (SATM, LGM, MTPS, MXR), pp. 399–403.
- CIKM-2015-AilemRN #clustering #composition #matrix
- Co-clustering Document-term Matrices by Direct Maximization of Graph Modularity (MA, FR, MN), pp. 1807–1810.
- CIKM-2015-AnastasiuK #named #nearest neighbour #performance
- L2Knng: Fast Exact K-Nearest Neighbor Graph Construction with L2-Norm Pruning (DCA, GK), pp. 791–800.
- CIKM-2015-CaoLX #learning #named
- GraRep: Learning Graph Representations with Global Structural Information (SC, WL0, QX), pp. 891–900.
- CIKM-2015-ChenCSS #named #scalability
- KSGM: Keynode-driven Scalable Graph Matching (XC, KSC, MLS, PS), pp. 1101–1110.
- CIKM-2015-GarimellaMGS #scalability
- Scalable Facility Location for Massive Graphs on Pregel-like Systems (KG, GDFM, AG, MS), pp. 273–282.
- CIKM-2015-HeLJ0 #learning
- Learning to Represent Knowledge Graphs with Gaussian Embedding (SH, KL0, GJ, JZ0), pp. 623–632.
- CIKM-2015-KhanGWB #nondeterminism #reliability
- Top-k Reliable Edge Colors in Uncertain Graphs (AK, FG, TW, FB), pp. 1851–1854.
- CIKM-2015-PetroniQDKI #clustering #named
- HDRF: Stream-Based Partitioning for Power-Law Graphs (FP, LQ, KD, SK, GI), pp. 243–252.
- CIKM-2015-ShangZKK #social #towards
- Towards Scale-out Capability on Social Graphs (HS, XZ0, RUK, MK), pp. 253–262.
- CIKM-2015-WangZTCZ #classification
- Defragging Subgraph Features for Graph Classification (HW, PZ0, IWT, LC0, CZ), pp. 1687–1690.
- CIKM-2015-YangHQXW #recommendation
- A Graph-based Recommendation across Heterogeneous Domains (DY, JH, HQ, YX, WW0), pp. 463–472.
- CIKM-2015-YangZ #classification #framework #online #optimisation
- A Min-Max Optimization Framework For Online Graph Classification (PY, PZ), pp. 643–652.
- CIKM-2015-ZhangJRXCY #learning #modelling #query
- Learning Entity Types from Query Logs via Graph-Based Modeling (JZ, LJ, AR, SX, YC, PSY), pp. 603–612.
- CIKM-2015-Zhao #clustering #named
- gSparsify: Graph Motif Based Sparsification for Graph Clustering (PZ), pp. 373–382.
- ECIR-2015-MoranL
- Graph Regularised Hashing (SM, VL), pp. 135–146.
- ECIR-2015-Peleja #named #sentiment
- PopMeter: Linked-Entities in a Sentiment Graph (FP), pp. 785–788.
- ECIR-2015-SabetghadamLBR #analysis #reachability
- Reachability Analysis of Graph Modelled Collections (SS, ML, RB, AR), pp. 370–381.
- ICML-2015-AsterisKDYC
- Stay on path: PCA along graph paths (MA, ATK, AGD, HGY, BC), pp. 1728–1736.
- ICML-2015-Bai0ZH #kernel
- An Aligned Subtree Kernel for Weighted Graphs (LB, LR, ZZ, ERH), pp. 30–39.
- ICML-2015-LibbrechtHBN
- Entropic Graph-based Posterior Regularization (ML, MMH, JAB, WSN), pp. 1992–2001.
- ICML-2015-LiuY #learning #predict
- Bipartite Edge Prediction via Transductive Learning over Product Graphs (HL, YY), pp. 1880–1888.
- ICML-2015-Pouget-AbadieH #framework
- Inferring Graphs from Cascades: A Sparse Recovery Framework (JPA, TH), pp. 977–986.
- ICML-2015-YangX15b #clustering #distributed #divide and conquer #framework
- A Divide and Conquer Framework for Distributed Graph Clustering (WY, HX), pp. 504–513.
- KDD-2015-BeutelAF #behaviour #detection #modelling #predict
- Graph-Based User Behavior Modeling: From Prediction to Fraud Detection (AB, LA, CF), pp. 2309–2310.
- KDD-2015-ElenbergSBD #distributed #framework #scalability
- Beyond Triangles: A Distributed Framework for Estimating 3-profiles of Large Graphs (ERE, KS, MB, AGD), pp. 229–238.
- KDD-2015-GleichM #algorithm #learning #using
- Using Local Spectral Methods to Robustify Graph-Based Learning Algorithms (DFG, MWM), pp. 359–368.
- KDD-2015-HallacLB #clustering #network #optimisation #scalability
- Network Lasso: Clustering and Optimization in Large Graphs (DH, JL, SB), pp. 387–396.
- KDD-2015-JohanssonD #geometry #learning #similarity #using
- Learning with Similarity Functions on Graphs using Matchings of Geometric Embeddings (FDJ, DPD), pp. 467–476.
- KDD-2015-KuoWWCYD #multi #segmentation
- Unified and Contrasting Cuts in Multiple Graphs: Application to Medical Imaging Segmentation (CTK, XW, PBW, OTC, JY, ID), pp. 617–626.
- KDD-2015-LimK #named
- MASCOT: Memory-efficient and Accurate Sampling for Counting Local Triangles in Graph Streams (YL, UK), pp. 685–694.
- KDD-2015-LiuWHX #framework #health
- Temporal Phenotyping from Longitudinal Electronic Health Records: A Graph Based Framework (CL, FW, JH, HX), pp. 705–714.
- KDD-2015-MaoWGS #learning #reduction
- Dimensionality Reduction Via Graph Structure Learning (QM, LW, SG, YS), pp. 765–774.
- KDD-2015-MottinBG #query
- Graph Query Reformulation with Diversity (DM, FB, FG), pp. 825–834.
- KDD-2015-ShahKZGF #named #summary
- TimeCrunch: Interpretable Dynamic Graph Summarization (NS, DK, TZ, BG, CF), pp. 1055–1064.
- KDD-2015-Shun #algorithm #estimation #evaluation #parallel
- An Evaluation of Parallel Eccentricity Estimation Algorithms on Undirected Real-World Graphs (JS), pp. 1095–1104.
- KDD-2015-SuYSSKVY #feedback
- Exploiting Relevance Feedback in Knowledge Graph Search (YS, SY, HS, MS, SK, MV, XY), pp. 1135–1144.
- KDD-2015-YanardagV #kernel
- Deep Graph Kernels (PY, SVNV), pp. 1365–1374.
- KDD-2015-ZhouLB #analysis #clustering
- Integrating Vertex-centric Clustering with Edge-centric Clustering for Meta Path Graph Analysis (YZ, LL, DB), pp. 1563–1572.
MLDM-2015-DhulekarNOY #learning #mining #predict- Seizure Prediction by Graph Mining, Transfer Learning, and Transformation Learning (ND, SN, BO, BY), pp. 32–52.
- MLDM-2015-FerrerSR #approximate #distance #edit distance #heuristic #learning
- Learning Heuristics to Reduce the Overestimation of Bipartite Graph Edit Distance Approximation (MF, FS, KR), pp. 17–31.
- MLDM-2015-RiesenFDB #distance #edit distance
- Greedy Graph Edit Distance (KR, MF, RD, HB), pp. 3–16.
- MLDM-2015-SejalSTAVIP #query #similarity
- Query Click and Text Similarity Graph for Query Suggestions (DS, KGS, VT, DA, KRV, SSI, LMP), pp. 328–341.
SEKE-2015-ZegarraCW #learning #visualisation- Facilitating Peer Learning and Knowledge Sharing in STEM Courses via Pattern Based Graph Visualization (EZ, SKC, JW), pp. 284–289.
SIGIR-2015-Al-Dhelaan #multi #named #summary- StarSum: A Simple Star Graph for Multi-document Summarization (MAD), pp. 715–718.
- SIGIR-2015-GuoL #automation #generative #music #recommendation
- Automatic Feature Generation on Heterogeneous Graph for Music Recommendation (CG, XL), pp. 807–810.
- SIGIR-2015-YuM #quality #similarity
- High Quality Graph-Based Similarity Search (WY, JAM), pp. 83–92.
- PEPM-2015-BahrA #traversal
- Generalising Tree Traversals to DAGs: Exploiting Sharing without the Pain (PB, EA), pp. 27–38.
- PLDI-2015-JohnsonWMC #dependence #security
- Exploring and enforcing security guarantees via program dependence graphs (AJ, LW, SM, SC), pp. 291–302.
- PLDI-2015-LalQ #source code
- DAG inlining: a decision procedure for reachability-modulo-theories in hierarchical programs (AL, SQ), pp. 280–290.
- PLDI-2015-PrountzosMP #automation #parallel #source code
- Synthesizing parallel graph programs via automated planning (DP, RM, KP), pp. 533–544.
POPL-2015-BonchiSZ #abstraction- Full Abstraction for Signal Flow Graphs (FB, PS, FZ), pp. 515–526.
- ASE-2015-YangZWWYR #android
- Static Window Transition Graphs for Android (T) (SY, HZ, HW, YW, DY, AR), pp. 658–668.
ICSE-v1-2015-NguyenN #statistics- Graph-Based Statistical Language Model for Code (ATN, TNN), pp. 858–868.
SAC-2015-CamaraHJJ #modelling #persuasion #recommendation #social #using- Using graph-based models in a persuasive social recommendation system (JPC, SH, JJ, VJ), pp. 189–194.
- SAC-2015-FerreiraPC #matrix
- Exploring graph topology via matrix factorization to improve wikification (RF, MdGCP, MC), pp. 1099–1104.
- SAC-2015-GimenesGRG #analysis #multimodal #repository
- Multimodal graph-based analysis over the DBLP repository: critical discoveries and hypotheses (GPG, HG, JFRJ, MG), pp. 1129–1135.
- SAC-2015-GuedesBOX #clustering #multi
- Exploring multiple clusterings in attributed graphs (GPG, EB, ESO, GX), pp. 915–918.
- SAC-2015-MiyashitaITK #distributed #named #representation
- Catalogue: graph representation of file relations for a globally distributed environment (YM, HI, FT, KK), pp. 806–809.
- SAC-2015-SioutisSC #composition #on the #reasoning
- On the use and effect of graph decomposition in qualitative spatial and temporal reasoning (MS, YS, JFC), pp. 1874–1879.
- ASPLOS-2015-HassaanNP #dependence
- Kinetic Dependence Graphs (MAH, DDN, KP), pp. 457–471.
- CASE-2015-HeLG #optimisation
- Cycle time optimization of deterministic timed weighted marked graphs (ZH, ZL, AG), pp. 274–279.
- CASE-2015-KouiderHOO #approach #integer #linear #scheduling #source code
- Mixed integer linear programs and tabu search approach to solve mixed graph coloring for unit-time job shop scheduling (AK, HAH, SO, AO), pp. 1177–1181.
- CGO-2015-LeissaKH #higher-order #representation
- A graph-based higher-order intermediate representation (RL, MK, SH), pp. 202–212.
DAC-2015-HanF #analysis #approach #cpu #gpu #scalability- Transient-simulation guided graph sparsification approach to scalable harmonic balance (HB) analysis of post-layout RF circuits leveraging heterogeneous CPU-GPU computing systems (LH, ZF), p. 6.
- DAC-2015-SripadaP #approach
- A timing graph based approach to mode merging (SS, MP), p. 6.
DATE-2015-Baruah #scheduling- The federated scheduling of constrained-deadline sporadic DAG task systems (SB), pp. 1323–1328.
HPDC-2015-YangC #behaviour #benchmark #comprehension #metric #robust- Understanding Graph Computation Behavior to Enable Robust Benchmarking (FY, AAC), pp. 173–178.
- HPDC-2015-ZhouLLPZ #abstraction #parallel #performance
- Fast Iterative Graph Computation with Resource Aware Graph Parallel Abstractions (YZ, LL, KL, CP, QZ), pp. 179–190.
PDP-2015-AliAP #data flow #parametricity #realtime- Generalized Extraction of Real-Time Parameters for Homogeneous Synchronous Dataflow Graphs (HIA, BA, LMP), pp. 701–710.
PPoPP-2015-HarshvardhanAR #algorithm #approach #communication #parallel- A hierarchical approach to reducing communication in parallel graph algorithms (H, NMA, LR), pp. 285–286.
- PPoPP-2015-SeoKK #named #scalability #streaming
- GStream: a graph streaming processing method for large-scale graphs on GPUs (HS, JK, MSK), pp. 253–254.
- PPoPP-2015-ShiLDHJLWLZ #gpu #hybrid #optimisation
- Optimization of asynchronous graph processing on GPU with hybrid coloring model (XS, JL, SD, BH, HJ, LL, ZW, XL, JZ), pp. 271–272.
- PPoPP-2015-WangDPWRO #gpu #library #named
- Gunrock: a high-performance graph processing library on the GPU (YW, AAD, YP, YW, AR, JDO), pp. 265–266.
SOSP-2015-0002BMZ #named- Chaos: scale-out graph processing from secondary storage (AR, LB, JM, WZ), pp. 410–424.
- SOSP-2015-TeixeiraFSSZA #distributed #mining #named
- Arabesque: a system for distributed graph mining (CHCT, AJF, MS, GS, MJZ, AA), pp. 425–440.
STOC-2015-AlstrupKTZ - Adjacency Labeling Schemes and Induced-Universal Graphs (SA, HK, MT, UZ), pp. 625–634.
- STOC-2015-AlwenS #complexity #parallel
- High Parallel Complexity Graphs and Memory-Hard Functions (JA, VS), pp. 595–603.
- STOC-2015-BansalGG #independence #on the #set
- On the Lovász Theta function for Independent Sets in Sparse Graphs (NB, AG, GG), pp. 193–200.
- STOC-2015-Bresler #learning #modelling
- Efficiently Learning Ising Models on Arbitrary Graphs (GB), pp. 771–782.
- STOC-2015-ChawlaMSY #algorithm #clustering
- Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs (SC, KM, TS, GY), pp. 219–228.
- STOC-2015-CzumajPS #clustering #testing
- Testing Cluster Structure of Graphs (AC, PP, CS), pp. 723–732.
- STOC-2015-HalldorssonT #how #question
- How Well Can Graphs Represent Wireless Interference? (MMH, TT), pp. 635–644.
- STOC-2015-KawarabayashiS #approximate
- Beyond the Euler Characteristic: Approximating the Genus of General Graphs (KiK, AS), pp. 675–682.
- STOC-2015-KawarabayashiT
- Deterministic Global Minimum Cut of a Simple Graph in Near-Linear Time (KiK, MT), pp. 665–674.
- STOC-2015-Lee
- Hardness of Graph Pricing Through Generalized Max-Dicut (EL), pp. 391–399.
- CAV-2015-ChatterjeeIP #algorithm #constant #performance #verification
- Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs (KC, RIJ, AP), pp. 140–157.
- CAV-2015-ErezN #automation #bound #smt #using
- Finding Bounded Path in Graph Using SMT for Automatic Clock Routing (AE, AN), pp. 20–36.
ICTSS-2015-HalleCG #constraints #generative #testing- Graph Methods for Generating Test Cases with Universal and Existential Constraints (SH, ELC, SG), pp. 55–70.
LICS-2015-FigueiraL #logic #performance #query- Path Logics for Querying Graphs: Combining Expressiveness and Efficiency (DF, LL), pp. 329–340.
- LICS-2015-Reiter #automaton #distributed
- Distributed Graph Automata (FR), pp. 192–201.
QoSA-2014-JohnsenLPH #dependence #modelling #slicing #verification- Regression verification of AADL models through slicing of system dependence graphs (AJ, KL, PP, KH), pp. 103–112.
DocEng-2014-LimaBFFLSR - Transforming graph-based sentence representations to alleviate overfitting in relation extraction (RJL, JB, RF, FF, RDL, SJS, MR), pp. 53–62.
- JCDL-2014-ZhuCBW #named #visualisation
- CKGHV: a comprehensive knowledge graph for history visualization (YZ, XC, YB, JW), pp. 437–438.
- PODS-2014-Cohen #analysis #sketching
- All-distances sketches, revisited: HIP estimators for massive graphs analysis (EC), pp. 88–99.
- SIGMOD-2014-AroraSB #mining #statistics
- Mining statistically significant connected subgraphs in vertex labeled graphs (AA, MS, AB), pp. 1003–1014.
- SIGMOD-2014-CuiXWW #community #scalability
- Local search of communities in large graphs (WC, YX, HW, WW), pp. 991–1002.
- SIGMOD-2014-Dev14a #community #detection #precise #privacy #social
- Privacy preserving social graphs for high precision community detection (HD), pp. 1615–1616.
- SIGMOD-2014-FanWW #bound #query
- Querying big graphs within bounded resources (WF, XW, YW), pp. 301–312.
- SIGMOD-2014-HuangCQTY #community #query #scalability
- Querying k-truss community in large and dynamic graphs (XH, HC, LQ, WT, JXY), pp. 1311–1322.
- SIGMOD-2014-KimHLPY #framework #named #parallel #scalability
- OPT: a new framework for overlapped and parallel triangulation in large-scale graphs (JK, WSH, SL, KP, HY), pp. 637–648.
- SIGMOD-2014-MondalD #named #query #scalability
- EAGr: supporting continuous ego-centric aggregate queries over large dynamic graphs (JM, AD), pp. 1335–1346.
- SIGMOD-2014-PapailiouTKKK #data transformation #performance #rdf
- H2RDF+: an efficient data management system for big RDF graphs (NP, DT, IK, PK, NK), pp. 909–912.
- SIGMOD-2014-ParchasGPB #nondeterminism
- The pursuit of a good possible world: extracting representative instances of uncertain graphs (PP, FG, DP, FB), pp. 967–978.
- SIGMOD-2014-QinYCCZL #pipes and filters #scalability
- Scalable big graph processing in MapReduce (LQ, JXY, LC, HC, CZ, XL), pp. 827–838.
- SIGMOD-2014-RanuHS #database #query
- Answering top-k representative queries on graph databases (SR, MXH, AKS), pp. 1163–1174.
- SIGMOD-2014-SatishSPSPHSYD #dataset #framework #navigation #using
- Navigating the maze of graph analytics frameworks using massive graph datasets (NS, NS, MMAP, JS, JP, MAH, SS, ZY, PD), pp. 979–990.
- SIGMOD-2014-ShaoCCMYX #parallel #scalability
- Parallel subgraph listing in a large-scale graph (YS, BC, LC, LM, JY, NX), pp. 625–636.
- SIGMOD-2014-SricharanD
- Localizing anomalous changes in time-evolving graphs (KS, KD), pp. 1347–1358.
- SIGMOD-2014-WuJZ #nearest neighbour #performance #query #random #scalability
- Fast and unified local search for random walk based k-nearest-neighbor query in large graphs (YW, RJ, XZ), pp. 1139–1150.
- SIGMOD-2014-YangXWWSWY #named #query
- SLQ: a user-friendly graph querying system (SY, YX, YW, TW, HS, JW, XY), pp. 893–896.
- SIGMOD-2014-ZhuGCL #analysis #clustering #sentiment #social #social media
- Tripartite graph clustering for dynamic sentiment analysis on social media (LZ, AG, JC, KL), pp. 1531–1542.
- SIGMOD-2014-ZhuLWX #approach #order #query #reachability #scalability
- Reachability queries on large dynamic graphs: a total order approach (ADZ, WL, SW, XX), pp. 1323–1334.
- SIGMOD-2014-ZouHWYHZ #approach #data-driven #natural language #rdf
- Natural language question answering over RDF: a graph data driven approach (LZ, RH, HW, JXY, WH, DZ), pp. 313–324.
- VLDB-2014-ArenasDFKS #approach
- A Principled Approach to Bridging the Gap between Graph Data and their Schemas (MA, GID, AF, AK, KS), pp. 601–612.
- VLDB-2014-ElseidyASK #mining #named #scalability
- GRAMI: Frequent Subgraph and Pattern Mining in a Single Large Graph (ME, EA, SS, PK), pp. 517–528.
- VLDB-2014-FanWWD #distributed #simulation
- Distributed Graph Simulation: Impossibility and Possibility (WF, XW, YW, DD), pp. 1083–1094.
- VLDB-2014-GuptaSGGZLL #detection #online #realtime #recommendation #scalability #twitter
- Real-Time Twitter Recommendation: Online Motif Detection in Large Dynamic Graphs (PG, VS, AG, SG, VZ, QL, JL), pp. 1379–1380.
- VLDB-2014-HanDAOWJ #comparison
- An Experimental Comparison of Pregel-like Graph Processing Systems (MH, KD, KA, MTÖ, XW, TJ), pp. 1047–1058.
- VLDB-2014-JindalR0MDS #exclamation #named #relational
- VERTEXICA: Your Relational Friend for Graph Analytics! (AJ, PR, EW, SM, AD, MS), pp. 1669–1672.
- VLDB-2014-MaeharaAIK #personalisation #rank
- Computing Personalized PageRank Quickly by Exploiting Graph Structures (TM, TA, YI, KiK), pp. 1023–1034.
- VLDB-2014-PetermannJMR #integration
- Graph-based Data Integration and Business Intelligence with BIIIG (AP, MJ, RM, ER), pp. 1577–1580.
- VLDB-2014-QuamarDL #named #scalability
- NScale: Neighborhood-centric Analytics on Large Graphs (AQ, AD, JL), pp. 1673–1676.
- VLDB-2014-SalihogluW #algorithm #optimisation
- Optimizing Graph Algorithms on Pregel-like Systems (SS, JW), pp. 577–588.
- VLDB-2014-ShangY #approximate
- Auto-Approximation of Graph Computing (ZS, JXY), pp. 1833–1844.
- VLDB-2014-SimmenSDHLMSTX #big data #scalability
- Large-Scale Graph Analytics in Aster 6: Bringing Context to Big Data Discovery (DES, KS, JD, YH, SL, AM, VS, MT, YX), pp. 1405–1416.
- VLDB-2014-WuCHKLX #problem
- Path Problems in Temporal Graphs (HW, JC, SH, YK, YL, YX), pp. 721–732.
- VLDB-2014-XuCC #clustering #named
- LogGP: A Log-based Dynamic Graph Partitioning Method (NX, LC, BC), pp. 1917–1928.
- VLDB-2014-YanCLN #distributed #framework #named
- Blogel: A Block-Centric Framework for Distributed Computation on Real-World Graphs (DY, JC, YL, WN), pp. 1981–1992.
- VLDB-2014-YanCXLNB #algorithm #performance #problem
- Pregel Algorithms for Graph Connectivity Problems with Performance Guarantees (DY, JC, KX, YL, WN, YB), pp. 1821–1832.
- VLDB-2014-YangGYL #constraints
- Finding the Cost-Optimal Path with Time Constraint over Time-Dependent Graphs (YY, HG, JXY, JL), pp. 673–684.
- VLDB-2014-YangWSY #query
- Schemaless and Structureless Graph Querying (SY, YW, HS, XY), pp. 565–576.
- VLDB-2015-BuBJCC14 #data flow #named
- Pregelix: Big(ger) Graph Analytics on a Dataflow Engine (YB, VRB, JJ, MJC, TC), pp. 161–172.
- VLDB-2015-LuCYW14 #distributed #evaluation #scalability
- Large-Scale Distributed Graph Computing Systems: An Experimental Evaluation (YL, JC, DY, HW), pp. 281–292.
- VLDB-2015-ShenCJLOT14 #distributed #performance
- Fast Failure Recovery in Distributed Graph Processing Systems (YS, GC, HVJ, WL, BCO, BMT), pp. 437–448.
- VLDB-2015-SongGCW14 #pattern matching
- Event Pattern Matching over Graph Streams (CS, TG, CXC, JW), pp. 413–424.
- VLDB-2015-ThenKCHPK0V14 #multi #performance #traversal
- The More the Merrier: Efficient Multi-Source Graph Traversal (MT, MK, FC, TAHV, KP, AK, TN, HTV), pp. 449–460.
- VLDB-2015-ZhouGSY14 #distributed #named #online #scalability #using
- MOCgraph: Scalable Distributed Graph Processing Using Message Online Computing (CZ, JG, BS, JXY), pp. 377–388.
- VLDB-2015-ZhuYQ14 #online
- Leveraging Graph Dimensions in Online Graph Search (YZ, JXY, LQ), pp. 85–96.
- CSEET-2014-Steppe #analysis #dependence #design #education #using
- Teaching analysis of software designs using dependency graphs (KS), pp. 65–73.
- ICSME-2014-BhattacharyaNF #approach #developer
- Determining Developers’ Expertise and Role: A Graph Hierarchy-Based Approach (PB, IN, MF), pp. 11–20.
- SCAM-2014-Abi-AntounCVG #abstract interpretation #question #using
- Are Object Graphs Extracted Using Abstract Interpretation Significantly Different from the Code? (MAA, SC, RV, AG), pp. 245–254.
- DLT-J-2013-TanV14 #query #regular expression
- Regular Expressions for Querying Data graphs (TT, DV), pp. 971–986.
- DLT-2014-BerdinskyK #automation #on the #transitive
- On Automatic Transitive Graphs (DB, BK), pp. 1–12.
- DLT-2014-Sinya #automaton #finite
- Graph Spectral Properties of Deterministic Finite Automata — (RS), pp. 76–83.
- ICALP-v1-2014-AngeliniLBFPR
- Morphing Planar Graph Drawings Optimally (PA, GDL, GDB, FF, MP, VR), pp. 126–137.
- ICALP-v1-2014-BaswanaK #algorithm #incremental #maintenance
- Incremental Algorithm for Maintaining DFS Tree for Undirected Graphs (SB, SK), pp. 138–149.
- ICALP-v1-2014-BevernBBCFNW
- Star Partitions of Perfect Graphs (RvB, RB, LB, JC, VF, RN, GJW), pp. 174–185.
- ICALP-v1-2014-Biedl #on the
- On Area-Optimal Planar Graph Drawings (TCB), pp. 198–210.
- ICALP-v1-2014-DapicMM
- QCSP on Semicomplete Digraphs (PD, PM, BM), pp. 847–858.
- ICALP-v1-2014-FialaKKN #algorithm #aspect-oriented
- Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs (JF, PK, JK, RN), pp. 489–501.
- ICALP-v1-2014-KrawczykW #game studies #online
- Coloring Relatives of Interval Overlap Graphs via On-line Games (TK, BW), pp. 738–750.
- ICALP-v1-2014-Lampis #approximate #using
- Parameterized Approximation Schemes Using Graph Widths (ML), pp. 775–786.
- ICALP-v1-2014-MakarychevM #clustering
- Nonuniform Graph Partitioning with Unrelated Weights (KM, YM), pp. 812–822.
- ICALP-v1-2014-ReingoldRW #data type #pseudo
- Pseudorandom Graphs in Data Structures (OR, RDR, UW), pp. 943–954.
- ICALP-v1-2014-TulsianiWZ #game studies #parallel #rank
- Optimal Strong Parallel Repetition for Projection Games on Low Threshold Rank Graphs (MT, JW, YZ), pp. 1003–1014.
- ICALP-v1-2014-Wulff-Nilsen #approximate #distance #performance
- Faster Separators for Shallow Minor-Free Graphs via Dynamic Approximate Distance Oracles (CWN), pp. 1063–1074.
- ICALP-v1-2014-Yin #random
- Spatial Mixing of Coloring Random Graphs (YY), pp. 1075–1086.
- ICALP-v2-2014-AdjiashviliR #bound
- Labeling Schemes for Bounded Degree Graphs (DA, NR), pp. 375–386.
- ICALP-v2-2014-GiakkoupisSS #random
- Randomized Rumor Spreading in Dynamic Graphs (GG, TS, AS), pp. 495–507.
- ICALP-v2-2014-KopelowitzKPS #bound #worst-case
- Orienting Fully Dynamic Graphs with Worst-Case Time Bounds (TK, RK, EP, SS), pp. 532–543.
- LATA-2014-BeerenwinkelBBDP
- Covering Pairs in Directed Acyclic Graphs (NB, SB, PB, RD, YP), pp. 126–137.
- LATA-2014-BestD #bound #petri net
- Characterisation of the State Spaces of Live and Bounded Marked Graph Petri Nets (EB, RRD), pp. 161–172.
- LATA-2014-DasST #encoding #morphism
- Succinct Encodings of Graph Isomorphism (BD, PS, JT), pp. 285–296.
- FM-2014-RinastSG #performance #reduction
- A Graph-Based Transformation Reduction to Reach UPPAAL States Faster (JR, SS, DG), pp. 547–562.
FLOPS-2014-Bahr #compilation #correctness #proving #using- Proving Correctness of Compilers Using Structured Graphs (PB), pp. 221–237.
CHI-PLAY-2014-PommerFGSLPTD #game studies- The trial of galileo: a game of motion graphs (IP, MNF, AG, BS, JL, KP, DT, BD), pp. 363–366.
- CIG-2014-GrafP #monte carlo
- Common fate graph patterns in Monte Carlo Tree Search for computer go (TG, MP), pp. 1–8.
- CIG-2014-KimYK #geometry #monte carlo #representation #using
- Solving Geometry Friends using Monte-Carlo Tree Search with directed graph representation (HTK, DMY, KJK), pp. 1–2.
GT-VMT-2014-WangBL #alloy #model transformation #using #verification- Verification of Graph-based Model Transformations Using Alloy (XW, FB, YL).
- ICGT-2014-ArendtHRT #constraints #invariant #ocl
- From Core OCL Invariants to Nested Graph Constraints (TA, AH, HR, GT), pp. 97–112.
- ICGT-2014-DeckwerthV #constraints #generative
- Attribute Handling for Generating Preconditions from Graph Constraints (FD, GV), pp. 81–96.
- ICGT-2014-JansenN #generative #pointer #source code #summary
- Generating Abstract Graph-Based Procedure Summaries for Pointer Programs (CJ, TN), pp. 49–64.
- ICGT-2014-LambersO #reasoning
- Tableau-Based Reasoning for Graph Properties (LL, FO), pp. 17–32.
- ICGT-2014-PoskittP #higher-order #monad #source code #verification
- Verifying Monadic Second-Order Properties of Graph Programs (CMP, DP), pp. 33–48.
- ICGT-2014-SelimLCDO #model transformation #specification #verification
- Specification and Verification of Graph-Based Model Transformation Properties (GMKS, LL, JRC, JD, BJO), pp. 113–129.
- DUXU-DI-2014-AcarturkAH #comprehension
- Developing a Verbal Assistance System for Line Graph Comprehension (CA, ÖA, CH), pp. 373–382.
- DUXU-ELAS-2014-FloraB #behaviour #energy #feedback
- Energy Graph Feedback: Attention, Cognition and Behavior Intentions (JAF, BB), pp. 520–529.
VISSOFT-2014-BergelMDG #dependence #domain-specific language #visualisation- A Domain-Specific Language for Visualizing Software Dependencies as a Graph (AB, SM, SD, TG), pp. 45–49.
- VISSOFT-2014-MartinezZMBKT #constraints #paradigm #product line #visualisation
- Feature Relations Graphs: A Visualisation Paradigm for Feature Constraints in Software Product Lines (JM, TZ, RM, TFB, JK, YLT), pp. 50–59.
- ICEIS-v1-2014-PinheiroCML #algorithm
- An Evolutionary Algorithm for Graph Planarisation by Vertex Deletion (RLP, AAC, CFXdM, DLS), pp. 464–471.
- CIKM-2014-AgrawalGKK #concept #similarity #using
- Similarity Search using Concept Graphs (RA, SG, AK, KK), pp. 719–728.
- CIKM-2014-LiakosPS
- Pushing the Envelope in Graph Compression (PL, KP, MS), pp. 1549–1558.
- CIKM-2014-LiuTHLM #distributed #summary
- Distributed Graph Summarization (XL, YT, QH, WCL, JM), pp. 799–808.
- CIKM-2014-LiuYGS #feedback #pseudo #ranking #recommendation
- Meta-Path-Based Ranking with Pseudo Relevance Feedback on Heterogeneous Graph for Citation Recommendation (XL, YY, CG, YS), pp. 121–130.
- CIKM-2014-MassS #information management #keyword
- Knowledge Management for Keyword Search over Data Graphs (YM, YS), pp. 2051–2053.
- CIKM-2014-SpirinHDKB #analysis #facebook #network #online #people #query #scalability #social
- People Search within an Online Social Network: Large Scale Analysis of Facebook Graph Search Query Logs (NVS, JH, MD, KGK, MB), pp. 1009–1018.
- CIKM-2014-TongZC0 #nondeterminism #performance #probability #scalability
- Efficient Probabilistic Supergraph Search Over Large Uncertain Graphs (YT, XZ, CCC, LC), pp. 809–818.
- CIKM-2014-YuanCS #recommendation
- Graph-based Point-of-interest Recommendation with Geographical and Temporal Influences (QY, GC, AS), pp. 659–668.
- CIKM-2014-YuanW0 #nondeterminism #query #scalability
- Pattern Match Query in a Large Uncertain Graph (YY, GW, LC), pp. 519–528.
- CIKM-2014-ZhangLLW #multi #named
- PatentDom: Analyzing Patent Relationships on Multi-View Patent Graphs (LZ, LL, TL, DW), pp. 1369–1378.
- CIKM-2014-ZhangP #nondeterminism #scalability
- Scalable Vaccine Distribution in Large Graphs given Uncertain Data (YZ, BAP), pp. 1719–1728.
- CIKM-2014-ZhengZLHZ #performance #scalability
- Efficient Subgraph Skyline Search Over Large Graphs (WZ, LZ, XL, LH, DZ), pp. 1529–1538.
- ECIR-2014-GhamdiG #retrieval #video
- Video Clip Retrieval by Graph Matching (MAG, YG), pp. 412–417.
- ICML-c1-2014-ChanA #consistency #modelling
- A Consistent Histogram Estimator for Exchangeable Graph Models (SHC, EA), pp. 208–216.
- ICML-c1-2014-TandonR #learning
- Learning Graphs with a Few Hubs (RT, PDR), pp. 602–610.
- ICML-c2-2014-BratieresQNG #grid #predict #process #scalability
- Scalable Gaussian Process Structured Prediction for Grid Factor Graph Applications (SB, NQ, SN, ZG), pp. 334–342.
- ICML-c2-2014-ChenLX #clustering #nondeterminism
- Weighted Graph Clustering with Non-Uniform Uncertainties (YC, SHL, HX), pp. 1566–1574.
- ICML-c2-2014-FangCL #learning
- Graph-based Semi-supervised Learning: Realizing Pointwise Smoothness Probabilistically (YF, KCCC, HWL), pp. 406–414.
- ICML-c2-2014-JohanssonJDB #geometry #kernel #using
- Global graph kernels using geometric embeddings (FJ, VJ, DPD, CB), pp. 694–702.
- ICML-c2-2014-KurrasLB #geometry
- The f-Adjusted Graph Laplacian: a Diagonal Modification with a Geometric Interpretation (SK, UvL, GB), pp. 1530–1538.
- ICML-c2-2014-RavanbakhshSFG #problem
- Min-Max Problems on Factor Graphs (S(R, CS, BJF, RG), pp. 1035–1043.
- ICML-c2-2014-ValkoMKK
- Spectral Bandits for Smooth Graph Functions (MV, RM, BK, TK), pp. 46–54.
- ICPR-2014-AzizWH #kernel #using
- Graph Characterization Using Wave Kernel Trace (FA, RCW, ERH), pp. 3822–3827.
- ICPR-2014-BaiBH #kernel
- An Attributed Graph Kernel from the Jensen-Shannon Divergence (LB, HB, ERH), pp. 88–93.
- ICPR-2014-BaiHRE #complexity
- Directed Depth-Based Complexity Traces of Hypergraphs from Directed Line Graphs (LB, ERH, PR, FE), pp. 3874–3879.
- ICPR-2014-BertonL #learning
- Graph Construction Based on Labeled Instances for Semi-supervised Learning (LB, AdAL), pp. 2477–2482.
- ICPR-2014-BuiNK #music #using
- Staff Line Removal Using Line Adjacency Graph and Staff Line Skeleton for Camera-Based Printed Music Scores (HNB, ISN, SHK), pp. 2787–2789.
- ICPR-2014-ChandrasekharTMLLL #clustering #incremental #performance #retrieval #streaming #video
- Incremental Graph Clustering for Efficient Retrieval from Streaming Egocentric Video Data (VC, CT, WM, LL, XL, JHL), pp. 2631–2636.
- ICPR-2014-DiotFJMM #clustering
- Unsupervised Tracking from Clustered Graph Patterns (FD, ÉF, BJ, EM, OM), pp. 3678–3683.
- ICPR-2014-DornaikaBSR #classification #encoding #locality
- Locality Constrained Encoding Graph Construction and Application to Outdoor Object Classification (FD, AB, HS, YR), pp. 2483–2488.
- ICPR-2014-EscolanoH
- The Mutual Information between Graphs (FE, ERH), pp. 94–99.
- ICPR-2014-FuGYGY #detection
- Graph Construction for Salient Object Detection in Videos (KF, IYHG, YY, CG, JY), pp. 2371–2376.
- ICPR-2014-GauzereBV #encoding #kernel
- Graph Kernel Encoding Substituents’ Relative Positioning (BG, LB, DV), pp. 637–642.
- ICPR-2014-GrenierBV #kernel
- A Graph Kernel Incorporating Molecule’s Stereisomerism Information (PAG, LB, DV), pp. 631–636.
- ICPR-2014-GuoDM #recognition
- Graph-Based Kinship Recognition (YG, HD, LvdM), pp. 4287–4292.
- ICPR-2014-HachaniZP
- Kinematic Reeb Graph Extraction Based on Heat Diffusion (MH, AOZ, WP), pp. 3981–3986.
- ICPR-2014-Jain
- Margin Perceptrons for Graphs (BJJ), pp. 3851–3856.
- ICPR-2014-KuangLJL #3d
- Graph Contexts for Retrieving Deformable Non-rigid 3D Shapes (ZK, ZL, XJ, YL), pp. 2820–2825.
- ICPR-2014-LinnerS #alias #anti #distance #implementation
- A Graph-Based Implementation of the Anti-aliased Euclidean Distance Transform (EL, RS), pp. 1025–1030.
- ICPR-2014-LiuLFQGT #geometry #retrieval
- Plane Geometry Figure Retrieval Based on Bilayer Geometric Attributed Graph Matching (LL, XL, SF, JQ, LG, ZT), pp. 309–314.
- ICPR-2014-LiuZH #energy #optimisation
- Improved Optimization Based on Graph Cuts for Discrete Energy Minimization (KL, JZ, KH), pp. 2424–2429.
- ICPR-2014-ManfrediGC #energy #image #learning #segmentation
- Learning Graph Cut Energy Functions for Image Segmentation (MM, CG, RC), pp. 960–965.
- ICPR-2014-MutimbuR #image
- Factor Graphs for Image Processing (LDM, ARK), pp. 1443–1448.
- ICPR-2014-NocetiO #classification #kernel #process
- A Spectral Graph Kernel and Its Application to Collective Activities Classification (NN, FO), pp. 3892–3897.
- ICPR-2014-NourbakhshBP #approach #matrix
- A Matrix Factorization Approach to Graph Compression (FN, SRB, MP), pp. 76–81.
- ICPR-2014-OskarssonAT #multi #scalability
- Prime Rigid Graphs and Multidimensional Scaling with Missing Data (MO, KÅ, AT), pp. 750–755.
- ICPR-2014-PandaKC #random #scalability #summary #using #video
- Scalable Video Summarization Using Skeleton Graph and Random Walk (RP, SKK, ASC), pp. 3481–3486.
- ICPR-2014-PhamKC #image #learning
- Semi-supervised Learning on Bi-relational Graph for Image Annotation (HDP, KHK, SC), pp. 2465–2470.
- ICPR-2014-RiesenBF #approximate #distance #edit distance #metric
- Improving Graph Edit Distance Approximation by Centrality Measures (KR, HB, AF), pp. 3910–3914.
- ICPR-2014-RozzaMP #kernel #learning #novel
- A Novel Graph-Based Fisher Kernel Method for Semi-supervised Learning (AR, MM, AP), pp. 3786–3791.
- ICPR-2014-SilvaTT #approach #named
- BoG: A New Approach for Graph Matching (FBS, ST, RdST), pp. 82–87.
- ICPR-2014-WangEGLLF #approach #distance #documentation #edit distance #word
- A Coarse-to-Fine Word Spotting Approach for Historical Handwritten Documents Based on Graph Embedding and Graph Edit Distance (PW, VE, CG, CL, JL, AF), pp. 3074–3079.
- ICPR-2014-Wilson #modelling #network
- Graph Signatures for Evaluating Network Models (RCW), pp. 100–105.
- ICPR-2014-YeWH #analysis #component
- Graph Characterization from Entropy Component Analysis (CY, RCW, ERH), pp. 3845–3850.
- KDD-2014-AhmedDNK #framework
- Graph sample and hold: a framework for big-graph analytics (NKA, NGD, JN, RRK), pp. 1446–1455.
- KDD-2014-BonchiGKV #composition #nondeterminism
- Core decomposition of uncertain graphs (FB, FG, AK, YV), pp. 1316–1325.
- KDD-2014-BordesG #mining #tutorial
- Constructing and mining web-scale knowledge graphs: KDD 2014 tutorial (AB, EG), p. 1967.
- KDD-2014-BourseLV
- Balanced graph edge partition (FB, ML, MV), pp. 1456–1465.
- KDD-2014-ChenN #detection #parametricity #social #social media #statistics
- Non-parametric scan statistics for event detection and forecasting in heterogeneous social media graphs (FC, DBN), pp. 1166–1175.
- KDD-2014-DuanSLL #community #correlation #detection
- Community detection in graphs through correlation (LD, WNS, YL, HL), pp. 1376–1385.
- KDD-2014-GaddeAO #learning #using
- Active semi-supervised learning using sampling theory for graph signals (AG, AA, AO), pp. 492–501.
- KDD-2014-JiangCBFY #behaviour #named #scalability
- CatchSync: catching synchronized behavior in large directed graphs (MJ, PC, AB, CF, SY), pp. 941–950.
- KDD-2014-LofgrenBGC #estimation #named #personalisation #rank #scalability
- FAST-PPR: scaling personalized pagerank estimation for large graphs (PL, SB, AG, SC), pp. 1436–1445.
- KDD-2014-LuM #difference #estimation #exponential #privacy #random
- Exponential random graph estimation under differential privacy (WL, GM), pp. 921–930.
- KDD-2014-PerozziASM #clustering #detection #scalability
- Focused clustering and outlier detection in large attributed graphs (BP, LA, PIS, EM), pp. 1346–1355.
- KDD-2014-TamersoyRC #detection #mining #scalability
- Guilt by association: large scale malware detection by mining file-relation graphs (AT, KAR, DHC), pp. 1524–1533.
- KDD-2014-ZhouT #multi
- Multi-task copula by sparse graph regression (TZ, DT), pp. 771–780.
KDIR-2014-CastelltortL #analysis- NoSQL Graph-based OLAP Analysis (AC, AL), pp. 217–224.
- KDIR-2014-MohammadiMBRA #classification #parametricity
- A Noise Resilient and Non-parametric Graph-based Classifier (MM, SAM, EB, BR, AA), pp. 170–175.
KEOD-2014-SurynekS #big data #challenge #information management #logic #perspective #reasoning- Theoretical Challenges in Knowledge Discovery in Big Data — A Logic Reasoning and a Graph Theoretical Point of View (PS, PS), pp. 327–332.
KR-2014-FiondaGP #web- Knowledge Maps of Web Graphs (VF, CG, GP).
- KR-2014-Schuller #formal method
- Tackling Winograd Schemas by Formalizing Relevance Theory in Knowledge Graphs (PS).
- MLDM-2014-SchraagenK #consistency #using
- Record Linkage Using Graph Consistency (MS, WAK), pp. 471–483.
RecSys-2014-PetroniQ #clustering #distributed #matrix #named #probability- GASGD: stochastic gradient descent for distributed asynchronous matrix completion via graph partitioning (FP, LQ), pp. 241–248.
- RecSys-2014-TrevisiolASJ #recommendation
- Cold-start news recommendation with domain-dependent browse graph (MT, LMA, RS, AJ), pp. 81–88.
- SEKE-2014-WanZWS #analysis #performance #points-to
- Efficient Points-To Analysis for Partial Call Graph Construction (ZW, BZ, YW, YS), pp. 416–421.
- SIGIR-2014-GrausDTWR #communication #email #enterprise #recommendation #using
- Recipient recommendation in enterprises using communication graphs and email content (DG, DvD, MT, WW, MdR), pp. 1079–1082.
- SIGIR-2014-YuM #named
- Sig-SR: SimRank search over singular graphs (WY, JAM), pp. 859–862.
- SIGIR-2014-Zhang #rdf #scalability
- Graph-based large scale RDF data compression (WEZ), p. 1276.
- SIGIR-2014-ZhangLLZ #evolution #multi #named
- PatentLine: analyzing technology evolution on multi-view patent graphs (LZ, LL, TL, QZ), pp. 1095–1098.
- ICMT-2014-ErginS #design pattern #model transformation #towards
- Towards a Language for Graph-Based Model Transformation Design Patterns (HE, ES), pp. 91–105.
- MoDELS-2014-Bergmann #ocl
- Translating OCL to Graph Patterns (GB), pp. 670–686.
SPLC-2014-AngererPLGG #dependence #identification #product line- Identifying inactive code in product lines with configuration-aware system dependence graphs (FA, HP, DL, AG, PG), pp. 52–61.
- ECOOP-2014-AliRLDT #scala #source code
- Constructing Call Graphs of Scala Programs (KA, MR, OL, JD, FT), pp. 54–79.
- AdaEurope-2014-QamhiehM #analysis #multi #scheduling
- Schedulability Analysis for Directed Acyclic Graphs on Multiprocessor Systems at a Subtask Level (MQ, SM), pp. 119–133.
- POPL-2014-BeyeneCPR #approach #constraints #game studies #infinity
- A constraint-based approach to solving games on infinite graphs (TAB, SC, CP, AR), pp. 221–234.
- FSE-2014-JaffarM #control flow #slicing
- A path-sensitively sliced control flow graph (JJ, VM), pp. 133–143.
- FSE-2014-NguyenKN #embedded #web
- Building call graphs for embedded client-side code in dynamic web applications (HVN, CK, TNN), pp. 518–529.
- FSE-2014-XuanODF #congruence #developer
- Focus-shifting patterns of OSS developers and their congruence with call graphs (QX, AO, PTD, VF), pp. 401–412.
- ICSE-2014-LeP #control flow #interprocedural #multi #verification
- Patch verification via multiversion interprocedural control flow graphs (WL, SDP), pp. 1047–1058.
- SAC-2014-MaAS
- Project centralization based on graph coloring (LM, CA, HS), pp. 1086–1093.
- SAC-2014-SaSCTMR #named
- LEGi: context-aware lexicon consolidation by graph inspection (GS, TS, RC, FT, FM, LCdR), pp. 302–307.
- SAC-2014-SeelandKK #clustering
- Structural clustering of millions of molecular graphs (MS, AK, SK), pp. 121–128.
- SLE-2014-Hills #control flow
- Streamlining Control Flow Graph Construction with DCFlow (MH), pp. 322–341.
- CASE-2014-HeLG #optimisation
- Marking optimization of deterministic timed weighted marked graphs (ZH, ZL, AG), pp. 413–418.
- CGO-2014-HongSWO #domain-specific language #scalability
- Simplifying Scalable Graph Processing with a Domain-Specific Language (SH, SS, JW, KO), p. 208.
- DAC-2014-AmaruGM #algorithm #logic #novel #optimisation #performance
- Majority-Inverter Graph: A Novel Data-Structure and Algorithms for Efficient Logic Optimization (LGA, PEG, GDM), p. 6.
- DATE-2014-ChenHD #analysis #modelling
- May-happen-in-parallel analysis based on segment graphs for safe ESL models (WC, XH, RD), pp. 1–6.
- DATE-2014-FrijnsASVGSC #analysis
- Timing analysis of First-Come First-Served scheduled interval-timed Directed Acyclic Graphs (RF, SA, SS, JV, MCWG, RRHS, HC), pp. 1–6.
- DATE-2014-ParkYLL #memory management #representation
- Accelerating graph computation with racetrack memory and pointer-assisted graph representation (EP, SY, SL, HL), pp. 1–4.
- DATE-2014-ZhuGBS #data flow #scheduling
- Memory-constrained static rate-optimal scheduling of synchronous dataflow graphs via retiming (XYZ, MG, TB, SS), pp. 1–6.
HPCA-2014-LakshminarayanaK #algorithm- Spare register aware prefetching for graph algorithms on GPUs (NBL, HK), pp. 614–625.
- HPDC-2014-ChenDWCZG #communication #distributed #performance #perspective
- Computation and communication efficient graph processing with distributed immutable view (RC, XD, PW, HC, BZ, HG), pp. 215–226.
- HPDC-2014-KhorasaniVGB #named
- CuSha: vertex-centric graph processing on GPUs (FK, KV, RG, LNB), pp. 239–252.
- HPDC-2014-XueYQHD #concurrent #low cost #named #performance
- Seraph: an efficient, low-cost system for concurrent graph processing (JX, ZY, ZQ, SH, YD), pp. 227–238.
ISMM-2014-RatnakarN #analysis #constraints #performance #points-to- Push-pull constraint graph for efficient points-to analysis (BR, RN), pp. 25–33.
OSDI-2014-GonzalezXDCFS #data flow #distributed #framework #named- GraphX: Graph Processing in a Distributed Dataflow Framework (JEG, RSX, AD, DC, MJF, IS), pp. 599–613.
- PDP-2014-DalKT #performance #scalability #using
- Fast Diameter Computation of Large Sparse Graphs Using GPUs (GHD, WAK, FWT), pp. 632–639.
- PDP-2014-KotenkoDC #game studies #metric #security
- Security Metrics Based on Attack Graphs for the Olympic Games Scenario (IVK, ED, AC), pp. 561–568.
- FASE-2014-GomesPG #bytecode #control flow #java #source code
- Sound Control Flow Graph Extraction from Incomplete Java Bytecode Programs (PdCG, AP, DG), pp. 215–229.
FoSSaCS-2014-Lang #automaton #game studies #reachability- Resource Reachability Games on Pushdown Graphs (ML0), pp. 195–209.
- STOC-2014-AbrahamGGNT #composition
- Cops, robbers, and threatening skeletons: padded decomposition for minor-free graphs (IA, CG, AG, ON, KT), pp. 79–88.
- STOC-2014-AndoniNOY #algorithm #geometry #parallel #problem
- Parallel algorithms for geometric graph problems (AA, AN, KO, GY), pp. 574–583.
- STOC-2014-ElberfeldK #bound
- Embedding and canonizing graphs of bounded genus in logspace (ME, KiK), pp. 383–392.
- STOC-2014-GroheKS #first-order
- Deciding first-order properties of nowhere dense graphs (MG, SK, SS), pp. 89–98.
- STOC-2014-HenzingerKN #algorithm #reachability
- Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs (MH, SK, DN), pp. 674–683.
- STOC-2014-KawarabayashiKK #grid #problem #theorem
- An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem (KiK, YK, SK), pp. 70–78.
TACAS-2014-DudkaPV #contest #memory management #named- Predator: A Shape Analyzer Based on Symbolic Memory Graphs — (Competition Contribution) (KD, PP, TV), pp. 412–414.
- CAV-2014-WijsKB #component #composition
- GPU-Based Graph Decomposition into Strongly Connected and Maximal End Components (AW, JPK, DB), pp. 310–326.
ICLP-J-2014-CabalarFF #logic programming #source code- Causal Graph Justifications of Logic Programs (PC, JF, MF), pp. 603–618.
- ICLP-J-2014-CruzRGP #concurrent #linear #logic programming #programming language
- A Linear Logic Programming Language for Concurrent Programming over Graph Structures (FC, RR, SCG, FP), pp. 493–507.
- LICS-CSL-2014-BarceloM #combinator #logic #word
- Graph logics with rational relations: the role of word combinatorics (PB, PM), p. 10.
- LICS-CSL-2014-ChenM #classification #complexity #query
- One hierarchy spawns another: graph deconstructions and the complexity classification of conjunctive queries (HC, MM), p. 10.
- LICS-CSL-2014-Williams #first-order #performance
- Faster decision of first-order graph properties (RW), p. 6.
ECSA-2013-GassaraRJ #architecture #deployment #modelling #multi #towards- Towards a Multi-scale Modeling for Architectural Deployment Based on Bigraphs (AG, IBR, MJ), pp. 122–129.
- DocEng-2013-SrivastavaSM #interactive #topic
- A graph-based topic extraction method enabling simple interactive customization (AS, AJS, EEM), pp. 71–80.
DRR-2013-ZanibbiMV #pattern matching #pattern recognition #recognition- Evaluating structural pattern recognition for handwritten math via primitive label graphs (RZ, HM, CVG).
- HT-2013-LeginusDL #generative
- Graph based techniques for tag cloud generation (ML, PD, RL), pp. 148–157.
ICDAR-2013-0001LBP #approximate #documentation #string #visual notation- Near Convex Region Adjacency Graph and Approximate Neighborhood String Matching for Symbol Spotting in Graphical Documents (AD, JL, HB, UP), pp. 1078–1082.
- ICDAR-2013-GotoIFU #scalability #set #using
- Analyzing the Distribution of a Large-Scale Character Pattern Set Using Relative Neighborhood Graph (MG, RI, YF, SU), pp. 3–7.
- ICDAR-2013-HerzogSN #retrieval #using
- Using Harris Corners for the Retrieval of Graphs in Historical Manuscripts (RH, AS, BN), pp. 1295–1299.
- JCDL-2013-GollapalliMG #ranking #topic #using
- Ranking experts using author-document-topic graphs (SDG, PM, CLG), pp. 87–96.
- PODS-2013-Baeza #database #query
- Querying graph databases (PBB), pp. 175–188.
- PODS-2013-BaezaRV #database #semantics
- Semantic acyclicity on graph databases (PBB, MR, MYV), pp. 237–248.
- PODS-2013-BaganBG #query
- A trichotomy for regular simple path queries on graphs (GB, AB, BG), pp. 261–272.
- PODS-2013-LibkinRV #adaptation #query #rdf
- Trial for RDF: adapting graph query languages for RDF data (LL, JLR, DV), pp. 201–212.
- SIGMOD-2013-ArmstrongPBC #benchmark #database #facebook #metric #named #social
- LinkBench: a database benchmark based on the Facebook social graph (TGA, VP, DB, MC), pp. 1185–1196.
- SIGMOD-2013-ChangYQLLL #component #composition
- Efficiently computing k-edge connected components via graph decomposition (LC, JXY, LQ, XL, CL, WL), pp. 205–216.
- SIGMOD-2013-ChengHWF #named #query #reachability #scalability
- TF-Label: a topological-folding labeling scheme for reachability querying in a large graph (JC, SH, HW, AWCF), pp. 193–204.
- SIGMOD-2013-ChoudhuryHCRBF #named
- StreamWorks: a system for dynamic graph search (SC, LBH, GCJ, AR, SB, JF), pp. 1101–1104.
- SIGMOD-2013-HanLL #database #morphism #named #robust #scalability #towards
- Turboiso: towards ultrafast and robust subgraph isomorphism search in large graph databases (WSH, JL, JHL), pp. 337–348.
- SIGMOD-2013-HuTC
- Massive graph triangulation (XH, YT, CWC), pp. 325–336.
- SIGMOD-2013-ShaoWL #distributed #memory management #named
- Trinity: a distributed graph engine on a memory cloud (BS, HW, YL), pp. 505–516.
- SIGMOD-2013-ZhangYQCL #performance
- I/O efficient: computing SCCs in massive graphs (ZZ, JXY, LQ, LC, XL), pp. 181–192.
- SIGMOD-2013-ZhuZQ #approach #mining #performance
- A direct mining approach to efficient constrained graph pattern discovery (FZ, ZZ, QQ), pp. 821–832.
TPDL-2013-BikakisGLSDS #keyword #named #rdf- RDivF: Diversifying Keyword Search on RDF Graphs (NB, GG, JL, DS, TD, TKS), pp. 413–416.
- VLDB-2013-0007TR #effectiveness #keyword #performance #probability #query
- Probabilistic Query Rewriting for Efficient and Effective Keyword Search on Graph Data (LZ, TT, AR), pp. 1642–1653.
- VLDB-2013-BambaRHA #geometry #performance #statistics
- Statistics Collection in Oracle Spatial and Graph: Fast Histogram Construction for Complex Geometry Objects (BB, SR, YH, RA), pp. 1021–1032.
- VLDB-2013-CurtissBBDGJKLPSSWYZ #named #social
- Unicorn: A System for Searching the Social Graph (MC, IB, TB, SD, LG, TJ, SK, SL, PP, SS, GS, GW, CY, NZ), pp. 1150–1161.
- VLDB-2013-FanWW #pattern matching
- Diversified Top-k Graph Pattern Matching (WF, XW, YW), pp. 1510–1521.
- VLDB-2013-KhanWAY #named #performance #similarity
- NeMa: Fast Graph Search with Label Similarity (AK, YW, CCA, XY), pp. 181–192.
- VLDB-2013-LeeL #clustering #query #rdf #scalability #semantics
- Scaling Queries over Big RDF Graphs with Semantic Hash Partitioning (KL, LL), pp. 1894–1905.
- VLDB-2013-PavanTTW
- Counting and Sampling Triangles from a Graph Stream (AP, KT, ST, KLW), pp. 1870–1881.
- VLDB-2013-QiaoQCYT #keyword #scalability
- Top-K Nearest Keyword Search on Large Graphs (MQ, LQ, HC, JXY, WT), pp. 901–912.
- VLDB-2013-SarwatEHM #declarative #distributed #query #reachability
- Horton+: A Distributed System for Processing Declarative Reachability Queries over Partitioned Graphs (MS, SE, YH, MFM), pp. 1918–1929.
- VLDB-2013-SeoPSL #analysis #distributed #scalability
- Distributed SociaLite: A Datalog-Based Language for Large-Scale Graph Analysis (JS, JP, JS, MSL), pp. 1906–1917.
- VLDB-2013-ShkapskyZZ #datalog #query
- Graph Queries in a Next-Generation Datalog System (AS, KZ, CZ), pp. 1258–1261.
- VLDB-2013-WuYSIY #keyword #query
- Summarizing Answer Graphs Induced by Keyword Queries (YW, SY, MS, AI, XY), pp. 1774–1785.
- VLDB-2013-XieWBDG #performance
- Fast Iterative Graph Computation with Block Updates (WX, GW, DB, AJD, JG), pp. 2014–2025.
- VLDB-2013-YuanMG #mining
- Mining and Indexing Graphs for Supergraph Search (DY, PM, CLG), pp. 829–840.
- VLDB-2013-ZengYWSW #distributed #rdf #web
- A Distributed Graph Engine for Web Scale RDF Data (KZ, JY, HW, BS, ZW), pp. 265–276.
- VLDB-2013-ZhengZF0Z #performance #scalability #similarity
- Efficient SimRank-based Similarity Join Over Large Graphs (WZ, LZ, YF, LC, DZ), pp. 493–504.
- VLDB-2013-ZhongH #parallel
- Parallel Graph Processing on Graphics Processors Made Easy (JZ, BH), pp. 1270–1273.
- VLDB-2014-QiXSW13 #distance #towards
- Toward a Distance Oracle for Billion-Node Graphs (ZQ, YX, BS, HW), pp. 61–72.
- VLDB-2014-TianBCTM13
- From “Think Like a Vertex” to “Think Like a Graph” (YT, AB, SAC, ST, JM), pp. 193–204.
ICPC-2013-FalconeS #diagrams #eclipse #named #plugin #uml #visualisation- OnionUML: An Eclipse plug-in for visualizing UML class diagrams in onion graph notation (MF, BS), pp. 233–235.
- MSR-2013-WagstromJS #dataset #network #ruby
- A network of rails: a graph dataset of ruby on rails and associated projects (PW, CJ, AS), pp. 229–232.
WCRE-2013-BernardiCL #approach #design pattern #detection #modelling- A model-driven graph-matching approach for design pattern detection (MLB, MC, GADL), pp. 172–181.
- DLT-2013-LibkinTV #database #query #regular expression #word
- Regular Expressions with Binding over Data Words for Querying Graph Databases (LL, TT, DV), pp. 325–337.
- ICALP-v1-2013-BlasiusRW #orthogonal
- Optimal Orthogonal Graph Drawing with Convex Bend Costs (TB, IR, DW), pp. 184–195.
- ICALP-v1-2013-BringmannF #generative #geometry #performance #random
- Exact and Efficient Generation of Geometric Random Variates and Random Graphs (KB, TF), pp. 267–278.
- ICALP-v1-2013-ChekuriNS
- Maximum Edge-Disjoint Paths in k-Sums of Graphs (CC, GN, FBS), pp. 328–339.
- ICALP-v1-2013-CyganP #algorithm #bound #performance
- Faster Exponential-Time Algorithms in Graphs of Bounded Average Degree (MC, MP), pp. 364–375.
- ICALP-v1-2013-Lampis #bound #model checking
- Model Checking Lower Bounds for Simple Graphs (ML), pp. 673–683.
- ICALP-v1-2013-LauriaPRT #complexity #proving
- The Complexity of Proving That a Graph Is Ramsey (ML, PP, VR, NT), pp. 684–695.
- ICALP-v1-2013-LeviR
- A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor (RL, DR), pp. 709–720.
- ICALP-v1-2013-MathieuZ #distance #re-engineering
- Graph Reconstruction via Distance Oracles (CM, HZ), pp. 733–744.
- ICALP-v1-2013-WeimannY #approximate #linear
- Approximating the Diameter of Planar Graphs in Near Linear Time (OW, RY), pp. 828–839.
- ICALP-v2-2013-DereniowskiDKPU #collaboration #performance
- Fast Collaborative Graph Exploration (DD, YD, AK, DP, PU), pp. 520–532.
- ICALP-v2-2013-GanianHKOST #model checking
- FO Model Checking of Interval Graphs (RG, PH, DK, JO, JS, JT), pp. 250–262.
- ICALP-v2-2013-HartungNNS #analysis #complexity
- A Refined Complexity Analysis of Degree Anonymization in Graphs (SH, AN, RN, OS), pp. 594–606.
- ICALP-v2-2013-Marx
- The Square Root Phenomenon in Planar Graphs (DM), p. 28.
- ICALP-v2-2013-PettieS #algorithm #distributed #performance
- Fast Distributed Coloring Algorithms for Triangle-Free Graphs (SP, HHS), pp. 681–693.
- ICALP-v2-2013-SpirakisNR #random
- A Guided Tour in Random Intersection Graphs (PGS, SEN, CR), pp. 29–35.
- LATA-2013-AlurKTY #complexity #on the #problem
- On the Complexity of Shortest Path Problems on Discounted Cost Graphs (RA, SK, KT, YY), pp. 44–55.
- LATA-2013-Blanchet-SadriBFH #approach #polynomial
- A Graph Polynomial Approach to Primitivity (FBS, MB, NF, JH), pp. 153–164.
ICFP-2013-HidakaAHKN #order #query #recursion- Structural recursion for querying ordered graphs (SH, KA, ZH, HK, KN), pp. 305–318.
- CIG-2013-Brown #multi #network #search-based
- Examination of graphs in Multiple Agent Genetic Networks for Iterated Prisoner's Dilemma (JAB), pp. 1–8.
- GCM-J-2012-FaithfullPH #development
- Big Red: A Development Environment for Bigraphs (AJF, GP, TTH).
- GCM-J-2012-MantzTL #co-evolution
- Co-Transformation of Type and Instance Graphs Supporting Merging of Types and Retyping (FM, GT, YL).
- GCM-J-2012-PoskittP #correctness #source code #verification
- Verifying Total Correctness of Graph Programs (CMP, DP).
- GCM-J-2012-Radke #higher-order #monad
- HR* Graph Conditions Between Counting Monadic Second-Order and Second-Order Graph Formulas (HR).
- CHI-2013-AlperBRIF #analysis #comparison
- Weighted graph comparison techniques for brain connectivity analysis (BA, BB, NHR, TI, JDF), pp. 483–492.
- CHI-2013-PerinVF #interactive #multi #visualisation
- Interactive horizon graphs: improving the compact visualization of multiple time series (CP, FV, JDF), pp. 3217–3226.
- DUXU-WM-2013-Rafelsberger #evolution #interactive #visualisation
- Interactive Visualization of Evolving Force-Directed Graphs (WR), pp. 553–559.
- HCI-UC-2013-KuramochiOTHN #analysis #community #network #semantics #twitter #using
- Applying to Twitter Networks of a Community Extraction Method Using Intersection Graph and Semantic Analysis (TK, NO, KT, YH, SN), pp. 314–323.
EDOC-2013-MukkamalaHS #adaptation #towards- Towards Trustworthy Adaptive Case Management with Dynamic Condition Response Graphs (RRM, TTH, TS), pp. 127–136.
- EDOC-2013-PlataniotisKP #architecture #design #enterprise #using
- Relating Decisions in Enterprise Architecture Using Decision Design Graphs (GP, SdK, HAP), pp. 139–146.
- ICEIS-J-2013-SuB13a #fine-grained #identification #security
- Foundation for Fine-Grained Security and DRM Control Based on a Service Call Graph Context Identification (ZS, FB), pp. 226–241.
- ICEIS-v2-2013-SuB #analysis #composition #data flow #web #web service
- Service Call Graph (SCG) — Information Flow Analysis in Web Service Composition (ZS, FB), pp. 17–24.
- CIKM-2013-ChanLKLBR #matrix #using
- Discovering latent blockmodels in sparse and noisy graphs using non-negative matrix factorisation (JC, WL, AK, CL, JB, KR), pp. 811–816.
- CIKM-2013-FangYZ #scalability
- Active exploration: simultaneous sampling and labeling for large graphs (MF, JY, XZ), pp. 829–834.
- CIKM-2013-FiondaP #query
- Querying graphs with preferences (VF, GP), pp. 929–938.
- CIKM-2013-GuoZ #classification #comprehension #empirical #perspective
- Understanding the roles of sub-graph features for graph classification: an empirical study perspective (TG, XZ), pp. 817–822.
- CIKM-2013-HanW #mining #scalability
- Mining frequent neighborhood patterns in a large labeled graph (JH, JRW), pp. 259–268.
- CIKM-2013-HermanssonKJJD #ambiguity #kernel #using
- Entity disambiguation in anonymized graphs using graph kernels (LH, TK, FJ, VJ, DPD), pp. 1037–1046.
- CIKM-2013-LuoFHWB #bisimulation #memory management #reduction
- External memory K-bisimulation reduction of big graphs (YL, GHLF, JH, YW, PDB), pp. 919–928.
- CIKM-2013-MackoMS #clustering
- Local clustering in provenance graphs (PM, DWM, MIS), pp. 835–840.
- CIKM-2013-MalliarosV #modelling #social
- To stay or not to stay: modeling engagement dynamics in social graphs (FDM, MV), pp. 469–478.
- CIKM-2013-ParkC #algorithm #performance #pipes and filters #scalability
- An efficient MapReduce algorithm for counting triangles in a very large graph (HMP, CWC), pp. 539–548.
- CIKM-2013-ShaoYCM #named
- PAGE: a partition aware graph computation engine (YS, JY, BC, LM), pp. 823–828.
- CIKM-2013-TangwongsanPT #parallel #streaming
- Parallel triangle counting in massive streaming graphs (KT, AP, ST), pp. 781–786.
- CIKM-2013-WangLZ #approach #metric #multi #random #towards
- Towards metric fusion on multi-view data: a cross-view based graph random walk approach (YW, XL, QZ), pp. 805–810.
- CIKM-2013-YuanWJL #clustering #performance #streaming
- Efficient processing of streaming graphs for evolution-aware clustering (MY, KLW, GJS, YL), pp. 319–328.
- CIKM-2013-ZhangKGCZH
- Map search via a factor graph model (QZ, JK, YG, HC, YZ, XH), pp. 69–78.
- ECIR-2013-CarpinetoR #concept #query #semantics
- Semantic Search Log k-Anonymization with Generalized k-Cores of Query Concept Graph (CC, GR), pp. 110–121.
- ECIR-2013-ZhuGCLN #query #recommendation
- Recommending High Utility Query via Session-Flow Graph (XZ, JG, XC, YL, WN), pp. 642–655.
- ICML-c1-2013-KumarB #bound #learning
- Convex Relaxations for Learning Bounded-Treewidth Decomposable Graphs (KSSK, FRB), pp. 525–533.
- ICML-c2-2013-Tran-DinhKC #framework #learning #matrix
- A proximal Newton framework for composite minimization: Graph learning without Cholesky decompositions and matrix inversions (QTD, ATK, VC), pp. 271–279.
- ICML-c3-2013-AilonCX #clustering
- Breaking the Small Cluster Barrier of Graph Clustering (NA, YC, HX), pp. 995–1003.
- KDD-2013-AnchuriZBGS #approximate #mining
- Approximate graph mining with label costs (PA, MJZ, OB, SG, MS), pp. 518–526.
- KDD-2013-ChengZGWSW #clustering #flexibility #multi #robust
- Flexible and robust co-regularized multi-domain graph clustering (WC, XZ, ZG, YW, PFS, WW), pp. 320–328.
- KDD-2013-FriezeGT #algorithm #mining #modelling #scalability
- Algorithmic techniques for modeling and mining large graphs (AMAzING) (AMF, AG, CET), p. 1523.
- KDD-2013-GuALH #classification
- Selective sampling on graphs for classification (QG, CCA, JL, JH), pp. 131–139.
- KDD-2013-HanLPL0KY #named #parallel #performance
- TurboGraph: a fast parallel graph engine handling billion-scale graphs in a single PC (WSH, SL, KP, JHL, MSK, JK, HY), pp. 77–85.
- KDD-2013-MorenoNK #learning #modelling
- Learning mixed kronecker product graph models with simulated method of moments (SM, JN, SK), pp. 1052–1060.
- KDD-2013-NishimuraU #algorithm #clustering
- Restreaming graph partitioning: simple versatile algorithms for advanced balancing (JN, JU), pp. 1106–1114.
- KDD-2013-ShenY #difference #mining #privacy
- Mining frequent graph patterns with differential privacy (ES, TY), pp. 545–553.
- KDD-2013-UganderKBK #clustering #multi #network
- Graph cluster randomization: network exposure to multiple universes (JU, BK, LB, JMK), pp. 329–337.
- KDD-2013-WangGS
- Active search on graphs (XW, RG, JGS), pp. 731–738.
- KDD-2013-ZhuXWL #distance #performance #query #scalability
- Efficient single-source shortest path and distance queries on large graphs (ADZ, XX, SW, WL), pp. 998–1006.
- RecSys-2013-AhnPLL #recommendation
- A heterogeneous graph-based recommendation simulator (YA, SP, SL, SgL), pp. 471–472.
- RecSys-2013-BlankRS #keyword #recommendation
- Leveraging the citation graph to recommend keywords (IB, LR, GS), pp. 359–362.
- RecSys-2013-Shi #approach #recommendation #similarity
- Trading-off among accuracy, similarity, diversity, and long-tail: a graph-based recommendation approach (LS), pp. 57–64.
- RecSys-2013-TianJ #recommendation #using
- Recommending scientific articles using bi-relational graph-based iterative RWR (GT, LJ), pp. 399–402.
- SEKE-2013-CorreaOW #co-evolution #evolution #metamodelling #modelling #towards #traceability
- Towards Coupled Evolution of Metamodels, Models, Graph-Based Transformations and Traceability Links (CKFC, TCO, CW), pp. 747–752.
- SEKE-2013-LiLJJ #communication #comprehension #concurrent #debugging
- Locating and Understanding Concurrency Bugs Based on Edge-labeled Communication Graphs (HL, ML, TJ, ZJ), pp. 525–530.
- SIGIR-2013-FreitasFOC #approach #linked data #natural language #open data #query #semantics
- Answering natural language queries over linked data graphs: a distributional semantics approach (AF, FFdF, SO, EC), pp. 1107–1108.
- MoDELS-2013-SemerathHV #constraints #domain-specific language #query #validation
- Validation of Derived Features and Well-Formedness Constraints in DSLs — By Mapping Graph Queries to an SMT-Solver (OS, ÁH, DV), pp. 538–554.
- ECOOP-2013-AuerbachBCFR #compilation #configuration management #hardware
- The Shape of Things to Run — Compiling Complex Stream Graphs to Reconfigurable Hardware in Lime (JSA, DFB, PC, SF, RMR), pp. 679–706.
- ECOOP-2013-CoxCS #generative #invariant #relational
- QUIC Graphs: Relational Invariant Generation for Containers (AC, BYEC, SS), pp. 401–425.
- OOPSLA-2013-BalatsourasS
- Class hierarchy complementation: soundly completing a partial type graph (GB, YS), pp. 515–532.
- OOPSLA-2013-BoisSEE #concurrent #multi #scalability #thread #visualisation
- Bottle graphs: visualizing scalability bottlenecks in multi-threaded applications (KDB, JBS, SE, LE), pp. 355–372.
- PEPM-2013-OliveiraL #domain-specific language #syntax
- Abstract syntax graphs for domain specific languages (BCdSO, AL), pp. 87–96.
- PLDI-2013-JohnsonOZA #dependence #performance
- Fast condensation of the program dependence graph (NPJ, TO, AZ, DIA), pp. 39–50.
- POPL-2013-FarzanKP #data flow #induction
- Inductive data flow graphs (AF, ZK, AP), pp. 129–142.
PPDP-2013-AsadaHKHN #branch #calculus #finite #graph transformation #monad- A parameterized graph transformation calculus for finite graphs with monadic branches (KA, SH, HK, ZH, KN), pp. 73–84.
- PPDP-2013-LamoMRL #approach #bidirectional #declarative #model transformation
- A declarative and bidirectional model transformation approach based on graph co-spans (YL, FM, AR, JdL), pp. 1–12.
- ASE-2013-IzsoSBHR #metric #performance #precise #predict #query #towards
- Towards precise metrics for predicting graph query performance (BI, ZS, GB, ÁH, IR), pp. 421–431.
- ICSE-2013-FeldthausSSDT #approximate #ide #javascript #performance
- Efficient construction of approximate call graphs for JavaScript IDE services (AF, MS, MS, JD, FT), pp. 752–761.
- SAC-2013-HassanzadehN #algorithm #detection
- A semi-supervised graph-based algorithm for detecting outliers in online-social-networks (RH, RN), pp. 577–582.
- SAC-2013-LiZSL #approach #mining #named #novel
- WAVE-CIA: a novel CIA approach based on call graph mining (BL, QZ, XS, HL), pp. 1000–1005.
- SAC-2013-MaunzVH #mining
- Out-of-bag discriminative graph mining (AM, DV, CH), pp. 109–114.
- SAC-2013-SeelandKP #kernel #learning
- Model selection based product kernel learning for regression on graphs (MS, SK, BP), pp. 136–143.
- SAC-2013-Serafino #clustering #composition
- Speeding up graph clustering via modular decomposition based compression (PS), pp. 156–163.
- SAC-2013-SrivastavaSM #clustering #using
- Text clustering using one-mode projection of document-word bipartite graphs (AS, AJS, EEM), pp. 927–932.
- CASE-2013-LuSXPO #automation #multi #using
- Automatic building exterior mapping using multilayer feature graphs (YL, DS, YX, AGAP, SO), pp. 162–167.
- CGO-2013-YanTZYS #algorithm #fine-grained #named #parallel #traversal
- Vlock: Lock virtualization mechanism for exploiting fine-grained parallelism in graph traversal algorithms (JY, GT, XZ, EY, NS), p. 10.
- DAC-2013-BenazouzKHB #data flow #evaluation #liveness
- Liveness evaluation of a cyclo-static DataFlow graph (MB, AMK, TH, BB), p. 7.
- DATE-2013-Pomeranz #equivalence #fault #on the #set
- On candidate fault sets for fault diagnosis and dominance graphs of equivalence classes (IP), pp. 1083–1088.
- ISMM-2013-LiCK #analysis #pointer #precise #scalability
- Precise and scalable context-sensitive pointer analysis via value flow graph (LL, CC, NK), pp. 85–96.
LCTES-2013-BouakazT #data flow #scheduling- Buffer minimization in earliest-deadline first scheduling of dataflow graphs (AB, JPT), pp. 133–142.
- LCTES-2013-HuberPP #analysis #control flow #using
- Combined WCET analysis of bitcode and machine code using control-flow relation graphs (BH, DP, PPP), pp. 163–172.
- PPoPP-2013-EdmondsWL #algorithm #using
- Expressing graph algorithms using generalized active messages (NE, JW, AL), pp. 289–290.
- PPoPP-2013-ShunB #framework #lightweight #memory management #named
- Ligra: a lightweight graph processing framework for shared memory (JS, GEB), pp. 135–146.
- SOSP-2013-NguyenLP #framework #lightweight
- A lightweight infrastructure for graph analytics (DN, AL, KP), pp. 456–471.
- SOSP-2013-RoyMZ #named #streaming #using
- X-Stream: edge-centric graph processing using streaming partitions (AR, IM, WZ), pp. 472–488.
- FoSSaCS-2013-HaymanH #modelling #rule-based #semantics
- Pattern Graphs and Rule-Based Models: The Semantics of Kappa (JH, TH), pp. 1–16.
- STOC-2013-Bernstein #maintenance
- Maintaining shortest paths under deletions in weighted directed graphs: [extended abstract] (AB), pp. 725–734.
- STOC-2013-ChekuriC
- Large-treewidth graph decompositions and applications (CC, JC), pp. 291–300.
- STOC-2013-EisenstatK #algorithm #linear #multi
- Linear-time algorithms for max flow and multiple-source shortest paths in unit-weight planar graphs (DE, PNK), pp. 735–744.
- STOC-2013-GuptaTW #algorithm #bound
- Sparsest cut on bounded treewidth graphs: algorithms and hardness results (AG, KT, DW), pp. 281–290.
- STOC-2013-KawarabayashiY #testing
- Testing subdivision-freeness: property testing meets structural graph theory (KiK, YY), pp. 437–446.
- STOC-2013-KleinMS #linear #recursion
- Structured recursive separator decompositions for planar graphs in linear time (PNK, SM, CS), pp. 505–514.
- STOC-2013-Miller #optimisation #problem #scalability #using
- Solving large optimization problems using spectral graph theory (GLM), p. 981.
- STOC-2013-RodittyW #algorithm #approximate #performance
- Fast approximation algorithms for the diameter and radius of sparse graphs (LR, VVW), pp. 515–524.
- CAV-2013-HaaseIOP #logic #named #reasoning
- SeLoger: A Tool for Graph-Based Reasoning in Separation Logic (CH, SI, JO, MJP), pp. 790–795.
- LICS-2013-EickmeyerKK #first-order #invariant #logic #model checking
- Model Checking for Successor-Invariant First-Order Logic on Minor-Closed Graph Classes (KE, KiK, SK), pp. 134–142.
SAT-2013-Toran #complexity #morphism #on the- On the Resolution Complexity of Graph Non-isomorphism (JT), pp. 52–66.
- QoSA-2012-Abi-AntounAH #case study #experience #object-oriented
- Extraction of ownership object graphs from object-oriented code: an experience report (MAA, NA, ZH), pp. 133–142.
- DocEng-2012-ChuangW #documentation #morphism #xml
- Structure-conforming XML document transformation based on graph homomorphism (TRC, HYW), pp. 99–102.
- HT-2012-ChairunnandaFD #modelling #network #online #social
- Graph data partition models for online social networks (PC, SF, KD), pp. 175–180.
- HT-2012-KontopoulouPKG #matrix #metric
- Graph and matrix metrics to analyze ergodic literature for children (EMK, MP, TK, EG), pp. 133–142.
- PODS-2012-AhnGM #sketching
- Graph sketches: sparsification, spanners, and subgraphs (KJA, SG, AM), pp. 5–14.
- PODS-2012-ChoromanskiM #algorithm #database #power of #privacy #statistics
- The power of the dinur-nissim algorithm: breaking privacy of statistical and graph databases (KC, TM), pp. 65–76.
- SIGMOD-2012-AkogluCKKF #mining #named #scalability #visualisation
- OPAvion: mining and visualization in large graphs (LA, DHC, UK, DK, CF), pp. 717–720.
- SIGMOD-2012-AndersonTBRV #named
- PAnG: finding patterns in annotation graphs (PA, AT, JB, LR, MEV), pp. 677–680.
- SIGMOD-2012-ChengKCC #approach #distance #performance #query #scalability
- Efficient processing of distance queries in large graphs: a vertex cover approach (JC, YK, SC, CC), pp. 457–468.
- SIGMOD-2012-FaloutsosK #algorithm #mining #scalability
- Managing and mining large graphs: patterns and algorithms (CF, UK), pp. 585–588.
- SIGMOD-2012-FanLWW #query
- Query preserving graph compression (WF, JL, XW, YW), pp. 157–168.
- SIGMOD-2012-HellingsFH #bisimulation #performance
- Efficient external-memory bisimulation on DAGs (JH, GHLF, HJH), pp. 553–564.
- SIGMOD-2012-JinRDY #named #reachability #scalability
- SCARAB: scaling reachability computation on large graphs (RJ, NR, SD, JXY), pp. 169–180.
- SIGMOD-2012-JinRXL #approach #distance #query #scalability
- A highway-centric labeling approach for answering distance queries on large sparse graphs (RJ, NR, YX, VEL), pp. 445–456.
- SIGMOD-2012-MondalD #scalability
- Managing large dynamic graphs efficiently (JM, AD), pp. 145–156.
- SIGMOD-2012-ShaoWX #implementation #mining #scalability
- Managing and mining large graphs: systems and implementations (BS, HW, YX), pp. 589–592.
- SIGMOD-2012-VenkataramaniABCCDDFGHKLMPP #facebook #how #named #social
- TAO: how facebook serves the social graph (VV, ZA, NB, GCI, PC, PD, HD, JF, AG, JH, SK, NL, MM, DP, LP), pp. 791–792.
- SIGMOD-2012-XuKWCC #approach #clustering #modelling
- A model-based approach to attributed graph clustering (ZX, YK, YW, HC, JC), pp. 505–516.
- SIGMOD-2012-YangYZK #effectiveness #scalability #towards
- Towards effective partition management for large graphs (SY, XY, BZ, AK), pp. 517–528.
- VLDB-2012-AgarwalRB #clustering #identification #realtime
- Real Time Discovery of Dense Clusters in Highly Dynamic Graphs: Identifying Real World Events in Highly Dynamic Environments (MKA, KR, MB), pp. 980–991.
- VLDB-2012-BoldiBGT #injection #nondeterminism #obfuscation
- Injecting Uncertainty in Graphs for Identity Obfuscation (PB, FB, AG, TT), pp. 1376–1387.
- VLDB-2012-GuanYK #correlation
- Measuring Two-Event Structural Correlations on Graphs (ZG, XY, LMK), pp. 1400–1411.
- VLDB-2012-GuhaM #overview #sketching
- Graph Synopses, Sketches, and Streams: A Survey (SG, AM), pp. 2030–2031.
- VLDB-2012-PrakashF #comprehension #scalability
- Understanding and Managing Cascades on Large Graphs (BAP, CF), pp. 2024–2025.
- VLDB-2012-SilvaMZ #correlation #mining #scalability
- Mining Attribute-structure Correlated Patterns in Large Attributed Graphs (AS, WMJ, MJZ), pp. 466–477.
- VLDB-2012-SunWWSL #performance
- Efficient Subgraph Matching on Billion Node Graphs (ZS, HW, HW, BS, JL), pp. 788–799.
- VLDB-2012-YuanWCW #database #performance #probability #scalability #similarity
- Efficient Subgraph Similarity Search on Large Probabilistic Graph Databases (YY, GW, LC, HW), pp. 800–811.
- VLDB-2012-ZengH #algorithm #pattern matching
- Comments on “Stack-based Algorithms for Pattern Matching on DAGs” (QZ, HZ), pp. 668–679.
- VLDB-2013-CalvaneseGLV12 #database #query #relational
- Query Processing under GLAV Mappings for Relational and Graph Databases (DC, GDG, ML, MYV), pp. 61–72.
- VLDB-2013-LeeHKL12 #algorithm #comparison #database #morphism
- An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases (JL, WSH, RK, JHL), pp. 133–144.
ITiCSE-2012-Gibson #algorithm #education- Teaching graph algorithms to children of all ages (JPG), pp. 34–39.
CSMR-2012-HottaHK #dependence #identification #refactoring- Identifying, Tailoring, and Suggesting Form Template Method Refactoring Opportunities with Program Dependence Graph (KH, YH, SK), pp. 53–62.
- WCRE-2012-TeytonFB #library #migration #mining
- Mining Library Migration Graphs (CT, JRF, XB), pp. 289–298.
- WCRE-2012-VanciuA #data flow
- Ownership Object Graphs with Dataflow Edges (RV, MAA), pp. 267–276.
- ICALP-v1-2012-ChekuriEV #design #network #product line
- Node-Weighted Network Design in Planar and Minor-Closed Families of Graphs (CC, AE, AV), pp. 206–217.
- ICALP-v1-2012-CyganKPPW #clique
- Clique Cover and Graph Separation: New Incompressibility Results (MC, SK, MP, MP, MW), pp. 254–265.
- ICALP-v1-2012-FeigeJ
- Universal Factor Graphs (UF, SJ), pp. 339–350.
- ICALP-v1-2012-JefferyKM #complexity #matrix #multi #quantum #query #using
- Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision (SJ, RK, FM), pp. 522–532.
- ICALP-v1-2012-KratschPPW #multi #parametricity
- Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs (SK, MP, MP, MW), pp. 581–593.
- ICALP-v2-2012-ArrighiD
- Causal Graph Dynamics (PA, GD), pp. 54–66.
- ICALP-v2-2012-Elbassioni
- A QPTAS for ε-Envy-Free Profit-Maximizing Pricing on Line Graphs (KME), pp. 513–524.
- ICALP-v2-2012-GugelmannPP #clustering #random #sequence
- Random Hyperbolic Graphs: Degree Sequence and Clustering — (LG, KP, UP), pp. 573–585.
- ICALP-v2-2012-KosowskiLNS
- k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth (AK, BL, NN, KS), pp. 610–622.
- ICALP-v2-2012-Spielman #algorithm #equation #linear
- Algorithms, Graph Theory, and the Solution of Laplacian Linear Equations (DAS), pp. 24–26.
- LATA-2012-MiasnikovS #automation
- Cayley Graph Automatic Groups Are Not Necessarily Cayley Graph Biautomatic (AM, ZS), pp. 401–407.
- SEFM-2012-AmighiGGH #control flow #exception #java #source code
- Sound Control-Flow Graph Extraction for Java Programs with Exceptions (AA, PdCG, DG, MH), pp. 33–47.
- ICFP-2012-OliveiraC #functional #programming
- Functional programming with structured graphs (BCdSO, WRC), pp. 77–88.
GRAPHITE-2012-BeckmannFKM #analysis- A structural analysis of the A5/1 state transition graph (AB, JF, JK, UM), pp. 5–19.
- GRAPHITE-2012-ZambonR
- Graph Subsumption in Abstract State Space Exploration (EZ, AR), pp. 35–49.
- GT-VMT-2012-BottoniP #modelling
- Modeling context with graph annotations (PB, FPP).
- GT-VMT-2012-BrugginkHK #automaton #towards
- Towards Alternating Automata for Graph Languages (HJSB, MH, BK).
- GT-VMT-2012-Heussner #communication #graph grammar #model checking #process
- Model Checking Communicating Processes: Run Graphs, Graph Grammars, and MSO (AH).
- GT-VMT-2012-NatschlagerS #algebra #approach #graph transformation #inheritance
- A Flattening Approach for Attributed Type Graphs with Inheritance in Algebraic Graph Transformation (CN, KDS).
- GT-VMT-2012-Taentzer #generative #multi
- Instance Generation from Type Graphs with Arbitrary Multiplicities (GT).
- ICGT-2012-BlumeBEK #automaton #implementation #invariant #performance
- Efficient Symbolic Implementation of Graph Automata with Applications to Invariant Checking (CB, HJSB, DE, BK), pp. 264–278.
- ICGT-2012-LopesF #design #framework
- A Graph-Based Design Framework for Services (AL, JLF), pp. 1–19.
- ICGT-2012-OrejasBM
- Borrowed Contexts for Attributed Graphs (FO, AB, NM), pp. 126–140.
- ICGT-2012-Poskitt #source code #verification
- Verification of Graph Programs (CMP), pp. 420–422.
- ICGT-2012-RensinkZ #abstraction
- Pattern-Based Graph Abstraction (AR, EZ), pp. 66–80.
- ICGT-2012-TaentzerML #co-evolution
- Co-transformation of Graphs and Type Graphs with Application to Model Co-evolution (GT, FM, YL), pp. 326–340.
- CHI-2012-ZiemkiewiczGL #analysis #visualisation
- Analysis within and between graphs: observed user strategies in immunobiology visualization (CZ, SRG, DHL), pp. 1655–1658.
CSCW-2012-LungE #collaboration #named #reasoning- Inflo: collaborative reasoning via open calculation graphs (JL, SME), pp. 1199–1202.
- ICEIS-v2-2012-ChenFZ #3d #visualisation #web
- Exploring Structural Properties of Web Graphs through 3D Visualization (ZC, AF, KZ), pp. 233–238.
- CIKM-2012-BodenGS #clustering #evolution
- Tracing clusters in evolving graphs with node attributes (BB, SG, TS), pp. 2331–2334.
- CIKM-2012-CaoYDWW #modelling #process #recommendation #workflow
- Graph-based workflow recommendation: on improving business process modeling (BC, JY, SD, DW, ZW), pp. 1527–1531.
- CIKM-2012-CreceliusS #maintenance #nearest neighbour #scalability
- Pay-as-you-go maintenance of precomputed nearest neighbors in large graphs (TC, RS), pp. 952–961.
- CIKM-2012-DuanWZS #classification #twitter
- Graph-based collective classification for tweets (YD, FW, MZ, HYS), pp. 2323–2326.
- CIKM-2012-DurakPKS #modelling #network
- Degree relations of triangles in real-world networks and graph models (ND, AP, TGK, CS), pp. 1712–1716.
- CIKM-2012-EldardiryN #analysis #classification #how #predict
- An analysis of how ensembles of collective classifiers improve predictions in graphs (HE, JN), pp. 225–234.
- CIKM-2012-EmrichKNRSZ #monte carlo #nondeterminism #probability #query
- Exploration of monte-carlo based probabilistic query processing in uncertain graphs (TE, HPK, JN, MR, AS, AZ), pp. 2728–2730.
- CIKM-2012-GaoCK #keyword #scalability
- Information-complete and redundancy-free keyword search over large data graphs (BJG, ZC, QK), pp. 2639–2642.
- CIKM-2012-Gomez-RodriguezR #online #social
- Bridging offline and online social graph dynamics (MGR, MR), pp. 2447–2450.
- CIKM-2012-GubichevN #approximate #performance #scalability
- Fast approximation of steiner trees in large graphs (AG, TN), pp. 1497–1501.
- CIKM-2012-KimCS
- Impact neighborhood indexing (INI) in diffusion graphs (JHK, KSC, MLS), pp. 2184–2188.
- CIKM-2012-LeePKL #named #novel #ranking #recommendation
- PathRank: a novel node ranking measure on a heterogeneous graph for recommender systems (SL, SP, MK, SgL), pp. 1637–1641.
- CIKM-2012-LiuCBLR #mining
- Utilizing common substructures to speedup tensor factorization for mining dynamic graphs (WL, JC, JB, CL, KR), pp. 435–444.
- CIKM-2012-LiuKCBLPR #on the
- On compressing weighted time-evolving graphs (WL, AK, JC, JB, CL, JP, KR), pp. 2319–2322.
- CIKM-2012-LiYWK #proximity #scalability
- Density index and proximity search in large graphs (NL, XY, ZW, AK), pp. 235–244.
- CIKM-2012-LuYW #framework #image #named #novel #social
- SRGSIS: a novel framework based on social relationship graph for social image search (BL, YY, GW), pp. 2615–2618.
- CIKM-2012-MeleBG #recommendation
- The early-adopter graph and its application to web-page recommendation (IM, FB, AG), pp. 1682–1686.
- CIKM-2012-MendesMZB #similarity #using
- Measuring website similarity using an entity-aware click graph (PNM, PM, HZ, RB), pp. 1697–1701.
- CIKM-2012-PanZ #correlation #data type #named #query
- CGStream: continuous correlated graph query for data streams (SP, XZ), pp. 1183–1192.
- CIKM-2012-PanZ12a #query
- Continuous top-k query for graph streams (SP, XZ), pp. 2659–2662.
- CIKM-2012-RahmanBH #algorithm #analysis #approximate #named #scalability
- GRAFT: an approximate graphlet counting algorithm for large graph analysis (MR, MB, MAH), pp. 1467–1471.
- CIKM-2012-RamachandranG #identification #representation
- A word-order based graph representation for relevance identification (LR, EFG), pp. 2327–2330.
- CIKM-2012-SakrEH #hybrid #named #query #scalability
- G-SPARQL: a hybrid engine for querying large attributed graphs (SS, SE, YH), pp. 335–344.
- CIKM-2012-ShenWLW #approach #ontology
- A graph-based approach for ontology population with named entities (WS, JW, PL, MW), pp. 345–354.
- CIKM-2012-TongPEFF #scalability
- Gelling, and melting, large graphs by edge manipulation (HT, BAP, TER, MF, CF), pp. 245–254.
- CIKM-2012-WangWLL #keyword #ranking #using #wiki
- Exploring simultaneous keyword and key sentence extraction: improve graph-based ranking using wikipedia (XW, LW, JL, SL), pp. 2619–2622.
- CIKM-2012-WeningerBH #documentation #topic
- Document-topic hierarchies from document graphs (TW, YB, JH), pp. 635–644.
- CIKM-2012-YangYGL #multi
- Finding the optimal path over multi-cost graphs (YY, JXY, HG, JL), pp. 2124–2128.
- CIKM-2012-ZhukovskiyVPOGGSR #empirical #validation #web
- Empirical validation of the buckley-osthus model for the web host graph: degree and edge distributions (MZ, DV, YP, LO, EG, GG, PS, AMR), pp. 1577–1581.
- CIKM-2012-ZhuYCQ #approach #classification #feature model
- Graph classification: a diversified discriminative feature selection approach (YZ, JXY, HC, LQ), pp. 205–214.
- ECIR-2012-Bloom #analysis
- Applying Power Graph Analysis to Weighted Graphs (NB), pp. 548–551.
- ICML-2012-AlamgirL #distance #nearest neighbour #random
- Shortest path distance in random k-nearest neighbor graphs (MA, UvL), p. 163.
- ICML-2012-BorboudakisT #constraints #information management #network
- Incorporating Causal Prior Knowledge as Path-Constraints in Bayesian Networks and Maximal Ancestral Graphs (GB, IT), p. 59.
- ICML-2012-Busa-FeketeBK #classification #performance #using
- Fast classification using sparse decision DAGs (RBF, DB, BK), p. 99.
- ICML-2012-HaiderS #clustering #using
- Finding Botnets Using Minimal Graph Clusterings (PH, TS), p. 37.
- ICML-2012-JalaliS #dependence #learning
- Learning the Dependence Graph of Time Series with Latent Factors (AJ, SS), p. 83.
- ICML-2012-KimL #multi
- Latent Multi-group Membership Graph Model (MK, JL), p. 124.
- ICML-2012-KriegeM #kernel
- Subgraph Matching Kernels for Attributed Graphs (NK, PM), p. 42.
- ICML-2012-QuadriantoCL #clique #persistent #set
- The Most Persistent Soft-Clique in a Set of Sampled Graphs (NQ, CC, CHL), p. 32.
- ICPR-2012-AlbarelliBRVT #higher-order #recognition #representation
- A stable graph-based representation for object recognition through high-order matching (AA, FB, LR, SV, AT), pp. 3341–3344.
- ICPR-2012-BaiHHR #clustering #complexity #using
- Graph clustering using graph entropy complexity traces (LB, ERH, LH, PR), pp. 2881–2884.
- ICPR-2012-BaiHR #kernel #using
- Jensen-Shannon graph kernel using information functionals (LB, ERH, PR), pp. 2877–2880.
- ICPR-2012-BarducciM #component #recognition
- Object recognition in floor plans by graphs of white connected components (AB, SM), pp. 298–301.
- ICPR-2012-ChenWY #clustering #dataset
- Centroid-based clustering for graph datasets (LC, SW, XY), pp. 2144–2147.
- ICPR-2012-ChowdhuryKPD #design #using #video
- Video storyboard design using Delaunay graphs (ASC, SKK, RP, MND), pp. 3108–3111.
- ICPR-2012-DuttaGLBP #documentation #kernel #random #visual notation
- Combination of product graph and random walk kernel for symbol spotting in graphical documents (AD, JG, JL, HB, UP), pp. 1663–1666.
- ICPR-2012-GaoTLW #re-engineering
- A graph-based method of newspaper article reconstruction (LG, ZT, XL, YW), pp. 1566–1569.
- ICPR-2012-GauzereBVB #kernel
- Graph kernels based on relevant patterns and cycle information for chemoinformatics (BG, LB, DV, MB), pp. 1775–1778.
- ICPR-2012-GhoseMOMLFVCSM12a #3d #energy #framework #learning #probability #segmentation
- Graph cut energy minimization in a probabilistic learning framework for 3D prostate segmentation in MRI (SG, JM, AO, RM, XL, JF, JCV, JC, DS, FM), pp. 125–128.
- ICPR-2012-HanWHBR #generative #probability
- Sampling graphs from a probabilistic generative model (LH, RCW, ERH, LB, PR), pp. 1643–1646.
- ICPR-2012-HidoK #learning #similarity
- Hash-based structural similarity for semi-supervised Learning on attribute graphs (SH, HK), pp. 3009–3012.
- ICPR-2012-ItohTA #3d #image #sequence #using
- 3D tracking of soccer players using time-situation graph in monocular image sequence (HI, TT, YA), pp. 2532–2536.
- ICPR-2012-LiuLLC #image #reduction
- Graph-based dimensionality reduction for KNN-based image annotation (XL, RL, FL, QC), pp. 1253–1256.
- ICPR-2012-LiuSZ #feature model
- Sparsity Score: A new filter feature selection method based on graph (ML, DS, DZ), pp. 959–962.
- ICPR-2012-NarayanamN #algorithm #community #detection #distributed #game studies #information management #social
- A game theory inspired, decentralized, local information based algorithm for community detection in social graphs (RN, YN), pp. 1072–1075.
- ICPR-2012-PourdamghaniRZ #estimation #learning #metric
- Metric learning for graph based semi-supervised human pose estimation (NP, HRR, MZ), pp. 3386–3389.
- ICPR-2012-RebagliatiSPS #distance #edit distance #set #using
- Computing the graph edit distance using dominant sets (NR, ASR, MP, FS), pp. 1080–1083.
- ICPR-2012-RubioSLP #higher-order #image #representation
- Image contextual representation and matching through hierarchies and higher order graphs (JCR, JS, AML, NP), pp. 2664–2667.
- ICPR-2012-SerratosaCS #interactive
- Interactive graph matching by means of imposing the pairwise costs (FS, XC, ASR), pp. 1298–1301.
- ICPR-2012-ShenMZ #analysis #learning #online
- Unsupervised online learning trajectory analysis based on weighted directed graph (YS, ZM, JZ), pp. 1306–1309.
- ICPR-2012-ValevY #classification #clustering #using
- Classification using graph partitioning (VV, NY), pp. 1261–1264.
- ICPR-2012-WahlbergB #segmentation
- Graph based line segmentation on cluttered handwritten manuscripts (FW, AB), pp. 1570–1573.
- ICPR-2012-WangAG #adaptation #feature model #matrix
- Adaptive graph regularized Nonnegative Matrix Factorization via feature selection (JW, IA, XG), pp. 963–966.
- ICPR-2012-WeibelDWR #detection #using
- Contrast-enhancing seam detection and blending using graph cuts (TW, CD, DW, RR), pp. 2732–2735.
- ICPR-2012-WongLTYCCBW #approach #automation #locality
- Automatic localization of the macula in a supervised graph-based approach with contextual superpixel features (DWKW, JL, NMT, FY, XC, CMGC, MB, TYW), pp. 2063–2066.
- ICPR-2012-YiP #classification
- Sparse Granger causality graphs for human action classification (SY, VP), pp. 3374–3377.
- ICPR-2012-ZhangCYLS #constraints
- Stereo matching with Global Edge Constraint and Graph Cuts (HZ, FC, DY, YL, MS), pp. 372–375.
- ICPR-2012-ZhaoZWL #detection #mobile #robust
- Robust mobile spamming detection via graph patterns (YZ, ZZ, YW, JL), pp. 983–986.
- KDD-2012-BahmaniKMU #evolution #rank
- PageRank on an evolving graph (BB, RK, MM, EU), pp. 24–32.
- KDD-2012-BodenGHS #mining #multi
- Mining coherent subgraphs in multi-layer graphs with edge labels (BB, SG, HH, TS), pp. 1258–1266.
- KDD-2012-ChanLLBR #mining #multi #named
- SeqiBloc: mining multi-time spanning blockmodels in dynamic graphs (JC, WL, CL, JB, KR), pp. 651–659.
- KDD-2012-ChauAVTF #interactive #named #scalability #visualisation
- TourViz: interactive visualization of connection pathways in large graphs (DHC, LA, JV, HT, CF), pp. 1516–1519.
- KDD-2012-CorreaL #clustering #using
- Locally-scaled spectral clustering using empty region graphs (CDC, PL), pp. 1330–1338.
- KDD-2012-FengHKBP #mining
- Summarization-based mining bipartite graphs (JF, XH, BK, CB, CP), pp. 1249–1257.
- KDD-2012-GiatsidisBTV #collaboration #network #visual notation
- Visual exploration of collaboration networks based on graph degeneracy (CG, KB, DMT, MV), pp. 1512–1515.
- KDD-2012-HendersonGETBAKFL #mining #named #scalability
- RolX: structural role extraction & mining in large graphs (KH, BG, TER, HT, SB, LA, DK, CF, LL), pp. 1231–1239.
- KDD-2012-Li12b #algorithm #mining #nondeterminism
- Algorithms for mining uncertain graph data (JL), p. 813.
- KDD-2012-SeelandKK #clustering #kernel #learning
- A structural cluster kernel for learning on graphs (MS, AK, SK), pp. 516–524.
- KDD-2012-SondhiSTZ #framework #mining #named
- SympGraph: a framework for mining clinical notes through symptom relation graphs (PS, JS, HT, CZ), pp. 1167–1175.
- KDD-2012-StantonK #clustering #distributed #scalability #streaming
- Streaming graph partitioning for large distributed graphs (IS, GK), pp. 1222–1230.
- KDD-2012-YangYLSWY
- Feature grouping and selection over an undirected graph (SY, LY, YCL, XS, PW, JY), pp. 922–930.
- RecSys-2012-BelloginP #clustering #collaboration #using
- Using graph partitioning techniques for neighbour selection in user-based collaborative filtering (AB, JP), pp. 213–216.
- RecSys-2012-Heitmann #framework #multi #personalisation #semantics
- An open framework for multi-source, cross-domain personalisation with semantic interest graphs (BH), pp. 313–316.
- SEKE-2012-QiXW #concurrent #interprocedural #reachability #slicing #source code
- Slicing Concurrent Interprocedural Programs Based on Program Reachability Graphs (XQ, XX, PW), pp. 293–298.
- SEKE-2012-ZhangLS #impact analysis #mining
- Mining Call Graph for Change Impact Analysis (QZ, BL, XS), pp. 7–12.
- SIGIR-2012-FangHC
- Confidence-aware graph regularization with heterogeneous pairwise features (YF, BJPH, KCCC), pp. 951–960.
- SIGIR-2012-GaoWL #information retrieval #learning #mining #scalability
- Large-scale graph mining and learning for information retrieval (BG, TW, TYL), pp. 1194–1195.
- SIGIR-2012-KahngL #rdf
- Exploiting paths for entity search in RDF graphs (MK, SgL), pp. 1027–1028.
- SIGIR-2012-YangLLR #analysis #twitter
- Finding interesting posts in Twitter based on retweet graph analysis (MCY, JTL, SWL, HCR), pp. 1073–1074.
- ECOOP-2012-AliL
- Application-Only Call Graph Construction (KA, OL), pp. 688–712.
- OOPSLA-2012-PrountzosMP #concurrent #named #source code
- Elixir: a system for synthesizing concurrent graph programs (DP, RM, KP), pp. 375–394.
LOPSTR-2012-GieslSSEF #evaluation #logic programming #source code #symbolic computation #term rewriting- Symbolic Evaluation Graphs and Term Rewriting — A General Methodology for Analyzing Logic Programs (JG, TS, PSK, FE, CF), p. 1.
- PADL-2012-Lesniak #algorithm #haskell #named
- Palovca: Describing and Executing Graph Algorithms in Haskell (ML), pp. 153–167.
- PPDP-2012-GieslSSEF #evaluation #logic programming #source code #symbolic computation #term rewriting
- Symbolic evaluation graphs and term rewriting: a general methodology for analyzing logic programs (JG, TS, PSK, FE, CF), pp. 1–12.
- ICSE-2012-BhattacharyaINF #analysis #evolution #predict
- Graph-based analysis and prediction for software evolution (PB, MI, IN, MF), pp. 419–429.
- ICSE-2012-NguyenNNN12a #code completion #named
- GraPacc: A graph-based pattern-oriented, context-sensitive code completion tool (ATN, HAN, TTN, TNN), pp. 1407–1410.
- ICSE-2012-NguyenNNTNAN #code completion #source code
- Graph-based pattern-oriented, context-sensitive source code completion (ATN, TTN, HAN, AT, HVN, JMAK, TNN), pp. 69–79.
- SAC-2012-BenreguiaK #consistency #morphism #problem
- A consistency rule for graph isomorphism problem (BB, HK), pp. 906–911.
- SAC-2012-BrandnerC #data flow #dependence
- Copy elimination on data dependence graphs (FB, QC), pp. 1916–1918.
- SAC-2012-DragoB #analysis #architecture #design #manycore #named
- DAG3: a tool for design and analysis of applications for multicore architectures (MLD, JB), pp. 1159–1164.
- SAC-2012-KokaANSY #grid
- Row manipulation in the heterogeneous tabular forms with a hexadecimal grid graph model (SK, KA, KN, YS, TY), pp. 792–793.
- SAC-2012-NagarAB #functional #similarity #using
- Computing gene functional similarity using combined graphs (AN, HAM, SB), pp. 1381–1386.
- SAC-2012-PerroneDH #model checking
- A model checker for Bigraphs (GP, SD, TTH), pp. 1320–1325.
- SAC-2012-PriamiQZ #biology #imperative #self
- An imperative language of self-modifying graphs for biological systems (CP, PQ, RZ), pp. 1903–1909.
- SAC-2012-VirgilioR #approximate #biology #rdf
- Approximate matching over biological RDF graphs (RDV, SER), pp. 1413–1414.
- ASPLOS-2012-HongCSO #analysis #domain-specific language #named #performance
- Green-Marl: a DSL for easy and efficient graph analysis (SH, HC, ES, KO), pp. 349–362.
- CGO-2012-ParkCA #modelling #predict #using
- Using graph-based program characterization for predictive modeling (EP, JC, MAA), pp. 196–206.
- DAC-2012-ChoiOKH #architecture #data flow #manycore
- Executing synchronous dataflow graphs on a SPM-based multicore architecture (JC, HO, SK, SH), pp. 664–671.
- DATE-2012-DamavandpeymaSBGC #data flow #modelling
- Modeling static-order schedules in synchronous dataflow graphs (MD, SS, TB, MG, HC), pp. 775–780.
- DATE-2012-LiuTW #analysis #approach #parallel #statistics
- Parallel statistical analysis of analog circuits by GPU-accelerated graph-based approach (XL, SXDT, HW), pp. 852–857.
- DATE-2012-MeissnerMLH #framework #morphism #performance #synthesis #testing
- Fast isomorphism testing for a graph-based analog circuit synthesis framework (MM, OM, LL, LH), pp. 757–762.
- DATE-2012-ThieleE #analysis #data flow #optimisation #performance
- Optimizing performance analysis for synchronous dataflow graphs with shared resources (DT, RE), pp. 635–640.
- DATE-2012-YangGBSC #game studies #policy #resource management
- Playing games with scenario- and resource-aware SDF graphs through policy iteration (YY, MG, TB, SS, HC), pp. 194–199.
- HPDC-2012-UenoS #benchmark #metric #scalability
- Highly scalable graph search for the Graph500 benchmark (KU, TS), pp. 149–160.
- ISMM-2012-Nasre #analysis #constraints #performance #points-to
- Exploiting the structure of the constraint graph for efficient points-to analysis (RN), pp. 121–132.
- OSDI-2012-GonzalezLGBG #distributed #named
- PowerGraph: Distributed Graph-Parallel Computation on Natural Graphs (JEG, YL, HG, DB, CG), pp. 17–30.
- OSDI-2012-KyrolaBG #named #scalability
- GraphChi: Large-Scale Graph Computation on Just a PC (AK, GEB, CG), pp. 31–46.
- PPoPP-2012-MerrillGG #gpu #scalability #traversal
- Scalable GPU graph traversal (DM, MG, ASG), pp. 117–128.
- PPoPP-2012-ZhongH #overview
- An overview of Medusa: simplified graph processing on GPUs (JZ, BH), pp. 283–284.
- FASE-2012-MolRH #java
- Graph Transforming Java Data (MdM, AR, JJH), pp. 209–223.
- FASE-2012-SilvaTT #dependence #erlang
- System Dependence Graphs in Sequential Erlang (JS, ST, CT), pp. 486–500.
- STOC-2012-AbrahamCG #approximate #distance
- Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels (IA, SC, CG), pp. 1199–1218.
- STOC-2012-AlonMS #scalability
- Nearly complete graphs decomposable into large induced matchings and their applications (NA, AM, BS), pp. 1079–1090.
- STOC-2012-Chuzhoy12a #constant
- Routing in undirected graphs with constant congestion (JC), pp. 855–874.
- STOC-2012-GroheM #morphism #theorem
- Structure theorem and isomorphism test for graphs with excluded topological subgraphs (MG, DM), pp. 173–192.
- STOC-2012-KaufmanL #symmetry #transitive
- Edge transitive ramanujan graphs and symmetric LDPC good codes (TK, AL), pp. 359–366.
- STOC-2012-Molloy #random
- The freezing threshold for k-colourings of a random graph (MM), pp. 921–930.
- CSL-2012-KotekM #matrix #parametricity
- Connection Matrices and the Definability of Graph Parameters (TK, JAM), pp. 411–425.
- CSL-2012-Makowsky #complexity #parametricity
- Definability and Complexity of Graph Parameters (JAM), pp. 14–15.
- ICST-2012-DengJ #dependence
- Weighted System Dependence Graph (FD, JAJ), pp. 380–389.
- ICST-2012-MalikK #analysis #using
- Dynamic Shape Analysis Using Spectral Graph Properties (MZM, SK), pp. 211–220.
- LICS-2012-BarceloFL #logic #problem
- Graph Logics with Rational Relations and the Generalized Intersection Problem (PB, DF, LL), pp. 115–124.
- ICDAR-2011-DuttaLP
- Symbol Spotting in Line Drawings through Graph Paths Hashing (AD, JL, UP), pp. 982–986.
- ICDAR-2011-LiuLS #image #retrieval #using
- Retrieval of Envelope Images Using Graph Matching (LL, YL, CYS), pp. 99–103.
- ICDAR-2011-LuqmanRLB #documentation #image
- Subgraph Spotting through Explicit Graph Embedding: An Application to Content Spotting in Graphic Document Images (MML, JYR, JL, TB), pp. 870–874.
- ICDAR-2011-ManoharVCPN #clustering #segmentation
- Graph Clustering-Based Ensemble Method for Handwritten Text Line Segmentation (VM, SNPV, HC, RP, PN), pp. 574–578.
- ICDAR-2011-Saund #approach #image #maintenance
- A Graph Lattice Approach to Maintaining Dense Collections of Subgraphs as Image Features (ES), pp. 1069–1074.
- ICDAR-2011-WangWZ #online #using #verification
- On-line Signature Verification Using Segment-to-Segment Graph Matching (KW, YW, ZZ), pp. 804–808.
- PODS-2011-BarceloLR #query
- Querying graph patterns (PB, LL, JLR), pp. 199–210.
- SIGMOD-2011-FanLLTWW #incremental #pattern matching
- Incremental graph pattern matching (WF, JL, JL, ZT, XW, YW), pp. 925–936.
- SIGMOD-2011-GuanWZSY #correlation #ranking
- Assessing and ranking structural correlations in graphs (ZG, JW, QZ, AKS, XY), pp. 937–948.
- SIGMOD-2011-HanPLKY #analysis #performance
- iGraph in action: performance analysis of disk-based graph indexing techniques (WSH, MDP, JL, RK, JXY), pp. 1241–1242.
- SIGMOD-2011-KhanLYGCT #network #performance #scalability
- Neighborhood based fast graph search in large networks (AK, NL, XY, ZG, SC, ST), pp. 901–912.
- SIGMOD-2011-KonstantinidisA #approach #query #scalability
- Scalable query rewriting: a graph-based approach (GK, JLA), pp. 97–108.
- SIGMOD-2011-LianC #performance #probability #query #rdf
- Efficient query answering in probabilistic RDF graphs (XL, LC), pp. 157–168.
- SIGMOD-2011-SatuluriPR #clustering #scalability
- Local graph sparsification for scalable clustering (VS, SP, YR), pp. 721–732.
- SIGMOD-2011-ZhaoLXH #multi #network
- Graph cube: on warehousing and OLAP multidimensional networks (PZ, XL, DX, JH), pp. 853–864.
- TPDL-2011-TsatsaronisVTRNSZ #how #mining #modelling
- How to Become a Group Leader? or Modeling Author Types Based on Graph Mining (GT, IV, ST, MR, KN, MS, MZ), pp. 15–26.
- VLDB-2011-BlausteinCSAR
- Surrogate Parenthood: Protected and Informative Graphs (BTB, AC, LS, MDA, AR), pp. 518–527.
- VLDB-2011-Cudre-MaurouxE #data transformation
- Graph Data Management Systems for New Application Domains (PCM, SE), pp. 1510–1511.
- VLDB-2011-HuangAR #query #rdf #scalability
- Scalable SPARQL Querying of Large RDF Graphs (JH, DJA, KR), pp. 1123–1134.
- VLDB-2011-JinLDW #constraints #nondeterminism #reachability
- Distance-Constraint Reachability Computation in Uncertain Graphs (RJ, LL, BD, HW), pp. 551–562.
- VLDB-2011-KargarA #clique #keyword
- Keyword Search in Graphs: Finding r-cliques (MK, AA), pp. 681–692.
- VLDB-2011-KarwaRSY #analysis
- Private Analysis of Graph Structure (VK, SR, AS, GY), pp. 1146–1157.
- VLDB-2011-ParameswaranSGPW
- Human-assisted graph search: it’s okay to ask questions (AGP, ADS, HGM, NP, JW), pp. 267–278.
- VLDB-2011-RenLKZC #evolution #on the #query #sequence
- On Querying Historical Evolving Graph Sequences (CR, EL, BK, XZ, RC), pp. 726–737.
- VLDB-2011-YangPS #mining #multi #performance
- Fast Sparse Matrix-Vector Multiplication on GPUs: Implications for Graph Mining (XY, SP, PS), pp. 231–242.
- VLDB-2011-YangPS11a #database #relational #summary
- Summary Graphs for Relational Database Schemas (XY, CMP, DS), pp. 899–910.
- VLDB-2011-YuanWWC #nondeterminism #performance #scalability
- Efficient Subgraph Search over Large Uncertain Graphs (YY, GW, HW, LC), pp. 876–886.
- VLDB-2012-GaoJZYJW11 #approach #relational #scalability
- Relational Approach for Shortest Path Discovery over Large Graphs (JG, RJ, JZ, JXY, XJ, TW), pp. 358–369.
- VLDB-2012-MaCFHW11 #pattern matching
- Capturing Topology in Graph Pattern Matching (SM, YC, WF, JH, TW), pp. 310–321.
- VLDB-2012-ZhaoAW11 #estimation #named #query #sketching
- gSketch: On Query Estimation in Graph Streams (PZ, CCA, MW), pp. 193–204.
- ICSM-2011-PaymalPBS #evolution #metric #process #using
- Measuring disruption from software evolution activities using graph-based metrics (PP, RP, SB, HPS), pp. 532–535.
- ICSM-2011-SunKZ #api #detection #library
- Graph-based detection of library API imitations (CS, SCK, SJZ), pp. 183–192.
- SCAM-2011-PavluSK #alias #analysis #comparison #precise #set
- Computation of Alias Sets from Shape Graphs for Comparison of Shape Analysis Precision (VP, MS, AK), pp. 25–34.
- SCAM-2011-SawinR #algorithm
- Assumption Hierarchy for a CHA Call Graph Construction Algorithm (JS, AR), pp. 35–44.
- WCRE-2011-WangLJ #code search #dependence #topic
- Code Search via Topic-Enriched Dependence Graph Matching (SW, DL, LJ), pp. 119–123.
- DLT-J-2010-YuanCL11 #fault
- Linearly Many Faults in (n, k)-Star Graphs (AY, EC, LL), pp. 1729–1745.
AFL-2011-LoeligerN #design #user interface- Affordance Graphs for User Interface Design: Application of Category-theoretic Constructs (EAL, CLN), pp. 392–394.
- DLT-2011-KitaevSSU #on the
- On the Representability of Line Graphs (SK, PS, CS, HÚ), pp. 478–479.
- ICALP-v1-2011-AdlerKKLST #bound
- Tight Bounds for Linkages in Planar Graphs (IA, SGK, PKK, DL, SS, DMT), pp. 110–121.
- ICALP-v1-2011-BordewichK #agile #bound #set
- Rapid Mixing of Subset Glauber Dynamics on Graphs of Bounded Tree-Width (MB, RJK), pp. 533–544.
- ICALP-v1-2011-ChengMS
- Center Stable Matchings and Centers of Cover Graphs of Distributive Lattices (CTC, EM, IS), pp. 678–689.
- ICALP-v1-2011-FarzanK #distance #navigation
- Compact Navigation and Distance Oracles for Graphs with Small Treewidth (AF, SK), pp. 268–280.
- ICALP-v1-2011-KawarabayashiKS #approximate #bound #distance
- Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs (KiK, PNK, CS), pp. 135–146.
- ICALP-v1-2011-KuhnM
- Vertex Cover in Graphs with Locally Few Colors (FK, MM), pp. 498–509.
- ICALP-v1-2011-Moldenhauer #algorithm #approximate
- Primal-Dual Approximation Algorithms for Node-Weighted Steiner Forest on Planar Graphs (CM), pp. 748–759.
- ICALP-v1-2011-Nonner #clique #clustering
- Clique Clustering Yields a PTAS for max-Coloring Interval Graphs (TN), pp. 183–194.
- ICALP-v2-2011-Chechik #fault tolerance
- Fault-Tolerant Compact Routing Schemes for General Graphs (SC), pp. 101–112.
- ICALP-v2-2011-HermelinLWY #distance
- Distance Oracles for Vertex-Labeled Graphs (DH, AL, OW, RY), pp. 490–501.
- ICALP-v2-2011-MegowMS #algorithm #online
- Online Graph Exploration: New Results on Old and New Algorithms (NM, KM, PS), pp. 478–489.
- RTA-2011-GrathwohlKPS #named #reduction #term rewriting #visualisation #λ-calculus
- Anagopos: A Reduction Graph Visualizer for Term Rewriting and λ Calculus (NBBG, JK, JDP, JGS), pp. 61–70.
- GCM-2010-HoffmannM11 #adaptation #diagrams #generative
- Generating Instance Graphs from Class Diagrams with Adaptive Star Grammars (BH, MM).
- GCM-2010-PicardM11 #embedded #induction #problem #representation
- Coinductive Graph Representation: the Problem of Embedded Lists (CP, RM).
- GCM-2010-PlumpSS11 #automaton #finite #source code
- Minimizing Finite Automata with Graph Programs (DP, RS, AS).
AGTIVE-2011-GalvaoZRWA #analysis #knowledge-based- Knowledge-Based Graph Exploration Analysis (IG, EZ, AR, LW, MA), pp. 105–120.
- GT-VMT-2011-BrugginkH #decidability
- Decidability and Expressiveness of Finitely Representable Recognizable Graph Languages (HJSB, MH).
- GT-VMT-2011-VandinL #maude #model checking #towards
- Towards a Maude Tool for Model Checking Temporal Graph Properties (AV, ALL).
- CHI-2011-GuyPDGT #crowdsourcing #game studies #social
- Guess who?: enriching the social graph through a crowdsourcing game (IG, AP, TD, OG, IT), pp. 1373–1382.
- HCD-2011-NazemiBK #taxonomy #visual notation #visualisation
- User-Oriented Graph Visualization Taxonomy: A Data-Oriented Examination of Visual Features (KN, MB, AK), pp. 576–585.
- HCI-DDA-2011-HeL #image #modelling #segmentation
- An Image Segmentation Method for Chinese Paintings by Combining Deformable Models with Graph Cuts (NH, KL), pp. 571–579.
- HCI-ITE-2011-AbushamB #recognition #using
- Face Recognition Using Local Graph Structure (LGS) (EEAA, HKB), pp. 169–175.
- VISSOFT-2011-ErdemirTB #named #object-oriented #quality #visualisation
- E-Quality: A graph based object oriented software quality visualization tool (UE, UT, FB), pp. 1–8.
- VISSOFT-2011-LonnbergBM #concurrent #dependence #source code #visualisation
- Visualising concurrent programs with dynamic dependence graphs (JL, MBA, LM), pp. 1–4.
CAiSE-2011-GuabtniNB #correlation #interactive #using- Using Graph Aggregation for Service Interaction Message Correlation (AG, HRMN, BB), pp. 642–656.
- EDOC-2011-HildebrandtMS #design #using
- Designing a Cross-Organizational Case Management System Using Dynamic Condition Response Graphs (TTH, RRM, TS), pp. 161–170.
- CIKM-2011-CaoCS #named
- Skynets: searching for minimum trees in graphs with incomparable edge weights (HC, KSC, MLS), pp. 1775–1784.
- CIKM-2011-ClaudeL #social #web
- Practical representations for web and social graphs (FC, SL), pp. 1185–1190.
- CIKM-2011-DavisLMR #detection
- Detecting anomalies in graphs with numeric labels (MD, WL, PCM, GR), pp. 1197–1202.
- CIKM-2011-DengLPCX #ad hoc #database #predict #query #reachability
- Predicting the optimal ad-hoc index for reachability queries on graph databases (JD, FL, YP, BC, JX), pp. 2357–2360.
- CIKM-2011-ElbassuoniB #keyword #rdf
- Keyword search over RDF graphs (SE, RB), pp. 237–242.
- CIKM-2011-KermarrecLT #distributed #social
- Distributed social graph embedding (AMK, VL, GT), pp. 1209–1214.
- CIKM-2011-KimJHSZ #approach #corpus #mining
- Mining entity translations from comparable corpora: a holistic graph mapping approach (JK, LJ, SwH, YIS, MZ), pp. 1295–1304.
- CIKM-2011-MalikMOSS #ecosystem
- Exploring the corporate ecosystem with a semi-supervised entity graph (HHM, IM, MOO, SS, SS), pp. 1857–1866.
- CIKM-2011-NiuLX #named #ranking #using
- DIGRank: using global degree to facilitate ranking in an incomplete graph (XN, LL, KX), pp. 2297–2300.
- CIKM-2011-ShiLY #predict
- Collective prediction with latent graphs (XS, YL, PSY), pp. 1127–1136.
- CIKM-2011-TretyakovAGVD #estimation #performance #scalability
- Fast fully dynamic landmark-based estimation of shortest path distances in very large graphs (KT, AAC, LGB, JV, MD), pp. 1785–1794.
- CIKM-2011-WangNSTC #clustering #dependence #documentation #representation
- Representing document as dependency graph for document clustering (YW, XN, JTS, YT, ZC), pp. 2177–2180.
- CIKM-2011-WangWLZZ #analysis #approach #classification #hashtag #sentiment #topic #twitter
- Topic sentiment analysis in twitter: a graph-based hashtag sentiment classification approach (XW, FW, XL, MZ, MZ), pp. 1031–1040.
- CIKM-2011-XieY #named #performance #scalability
- CP-index: on the efficient indexing of large graphs (YX, PSY), pp. 1795–1804.
- CIKM-2011-XuZYCXZ #constraints #reachability #scalability
- Answering label-constraint reachability in large graphs (KX, LZ, JXY, LC, YX, DZ), pp. 1595–1600.
- CIKM-2011-YangZJ #multi #named #query
- DELTA: indexing and querying multi-labeled graphs (JY, SZ, WJ), pp. 1765–1774.
- CIKM-2011-ZhouPW #constraints #keyword #performance #scalability
- Efficient association discovery with keyword-based constraints on large graph data (MZ, YP, YW), pp. 2441–2444.
- CIKM-2011-ZhuQYKL #performance #quality #scalability
- High efficiency and quality: large graphs matching (YZ, LQ, JXY, YK, XL), pp. 1755–1764.
- ICML-2011-JalaliCSX #clustering #optimisation
- Clustering Partially Observed Graphs via Convex Optimization (AJ, YC, SS, HX), pp. 1001–1008.
- ICML-2011-LiuWKC
- Hashing with Graphs (WL, JW, SK, SFC), pp. 1–8.
- ICML-2011-LuoDNH
- Cauchy Graph Embedding (DL, CHQD, FN, HH), pp. 553–560.
- ICML-2011-WickRBCM #named
- SampleRank: Training Factor Graphs with Atomic Gradients (MLW, KR, KB, AC, AM), pp. 777–784.
- KDD-2011-AoyamaSSU #approximate #performance #similarity
- Fast approximate similarity search based on degree-reduced neighborhood graphs (KA, KS, HS, NU), pp. 1055–1063.
- KDD-2011-BifetHPG #data type #evolution #mining
- Mining frequent closed graphs on evolving data streams (AB, GH, BP, RG), pp. 591–599.
- KDD-2011-ChauKHF #interactive #machine learning #named #scalability #visualisation
- Apolo: interactive large graph sensemaking by combining machine learning and visualization (DHC, AK, JIH, CF), pp. 739–742.
- KDD-2011-DubeyCB #ranking
- Diversity in ranking via resistive graph centers (AD, SC, CB), pp. 78–86.
- KDD-2011-GaoLWWL #metadata #ranking #scalability
- Semi-supervised ranking on very large graphs with rich metadata (BG, TYL, WW, TW, HL), pp. 96–104.
- KDD-2011-HendersonGLAETF #mining #recursion #using
- It’s who you know: graph mining using recursive structural features (KH, BG, LL, LA, TER, HT, CF), pp. 663–671.
- KDD-2011-JiangFH #data type #locality #network
- Anomaly localization for network data streams with graph joint sparse PCA (RJ, HF, JH), pp. 886–894.
- KDD-2011-JinLA #nondeterminism #reliability
- Discovering highly reliable subgraphs in uncertain graphs (RJ, LL, CCA), pp. 992–1000.
- KDD-2011-KangTSLF #named #scalability
- GBASE: a scalable and general graph management system (UK, HT, JS, CYL, CF), pp. 1091–1099.
- KDD-2011-KongFY #classification
- Dual active feature and sample selection for graph classification (XK, WF, PSY), pp. 654–662.
- KDD-2011-NamataKG #identification
- Collective graph identification (GN, SK, LG), pp. 87–95.
- KDD-2011-ShiFZY #evolution
- Discovering shakers from evolving entities via cascading graph inference (XS, WF, JZ, PSY), pp. 1001–1009.
- KDD-2011-ToivonenZHH
- Compression of weighted graphs (HT, FZ, AH, AH), pp. 965–973.
- KDD-2011-TongHWKL #optimisation #ranking #scalability
- Diversified ranking on large graphs: an optimization viewpoint (HT, JH, ZW, RK, CYL), pp. 1028–1036.
- KDD-2011-ZhouBS #approach #ranking
- An iterated graph laplacian approach for ranking on manifolds (XZ, MB, NS), pp. 877–885.
- KDIR-2011-ClariziaCSGN #novel #query
- A Novel Query Expansion Technique based on a Mixed Graph of Terms (FC, FC, MDS, LG, PN), pp. 84–93.
- KDIR-2011-DeruyverH #approach #consistency #image #information management #semantics
- Semantic Graphs and Arc Consistency Checking — The Renewal of an Old Approach for Information Extraction from Images (AD, YH), pp. 515–522.
- KDIR-2011-LiVM #learning #relational #using #visual notation
- Unsupervised Handwritten Graphical Symbol Learning — Using Minimum Description Length Principle on Relational Graph (JL, CVG, HM), pp. 172–178.
- KDIR-2011-SanJuan
- Mapping Knowledge Domains — Combining Symbolic Relations with Graph Theory (ES), pp. 527–536.
- KDIR-2011-Vanetik #algorithm #mining #performance
- A Fast Algorithm for Mining Graphs of Prescribed Connectivity (NV), pp. 5–13.
- KEOD-2011-CruzN #ontology #xml
- A Graph-based Tool for the Translation of XML Data to OWL-DL Ontologies (CC, CN), pp. 361–364.
- KEOD-2011-FukumotoS #classification #clustering #semantics #word
- Semantic Classification of Unknown Words based on Graph-based Semi-supervised Clustering (FF, YS), pp. 37–46.
- KEOD-2011-YamasakiS
- A Graph Manipulation System Abstracted from e-Learning (SY, MS), pp. 466–469.
- RecSys-2011-LeeSKLL #multi #random #ranking #recommendation
- Random walk based entity ranking on graph for multidimensional recommendation (SL, SiS, MK, DL, SgL), pp. 93–100.
- SIGIR-2011-HanSZ #web
- Collective entity linking in web text: a graph-based method (XH, LS, JZ), pp. 765–774.
- SIGIR-2011-Jiang #query #semantics
- Query expansion based on a semantic graph model (XJ), pp. 1315–1316.
- SIGIR-2011-JiYGHHZC #learning #query #web
- Learning search tasks in queries and web pages via graph regularization (MJ, JY, SG, JH, XH, WVZ, ZC), pp. 55–64.
- SIGIR-2011-LeeHWHS #dataset #image #learning #multi #pipes and filters #scalability #using
- Multi-layer graph-based semi-supervised learning for large-scale image datasets using mapreduce (WYL, LCH, GLW, WHH, YFS), pp. 1121–1122.
- SIGIR-2011-Li #learning
- Learning for graphs with annotated edges (FL), pp. 1259–1260.
- SIGIR-2011-TangLWWL #ambiguity #network #social
- A bipartite graph based social network splicing method for person name disambiguation (JT, QL, TW, JW, WL), pp. 1233–1234.
- ICMT-2011-BergmannURV #emf #modelling #query
- A Graph Query Language for EMF Models (GB, ZU, IR, DV), pp. 167–182.
- PEPM-J-2007-MollerS11 #program analysis #xml
- XML graphs in program analysis (AM, MIS), pp. 492–515.
- POPL-2011-PrountzosMPM #analysis #optimisation #parallel #source code
- A shape analysis for optimizing parallel graph programs (DP, RM, KP, KSM), pp. 159–172.
- ESEC-FSE-2011-RamamurthiRS #analysis #data flow #probability #using
- Probabilistic dataflow analysis using path profiles on structure graphs (AR, SR, YNS), pp. 512–515.
- ICSE-2011-KumarKRL #mining #sequence
- Mining message sequence graphs (SK, SCK, AR, DL), pp. 91–100.
- ICSE-2011-Malik #analysis #using
- Dynamic shape analysis of program heap using graph spectra (MZM), pp. 952–955.
- SAC-2011-Jamil #query #unification #using
- Computing subgraph isomorphic queries using structural unification and minimum graph structures (HMJ), pp. 1053–1058.
- SAC-2011-KostakisKMM #comparison #using
- Improved call graph comparison using simulated annealing (OK, JK, HM, KM), pp. 1516–1523.
- SAC-2011-WangJZO #database #keyword
- Exact top-k keyword search on graph databases (MW, LJ, LZ, TO), pp. 985–986.
- SAC-2011-Zhang #analysis #constraints #geometry #problem
- Well-constrained completion for under-constrained geometric constraint problem based on connectivity analysis of graph (GFZ), pp. 1094–1099.
- SAC-2011-ZouaqGH #concept #using
- Ontologizing concept maps using graph theory (AZ, DG, MH), pp. 1687–1692.
- CGO-2011-ChakrabartiBBJS #memory management #optimisation #runtime #transaction
- The runtime abort graph and its application to software transactional memory optimization (DRC, PB, HJB, PGJ, RSS), pp. 42–53.
- DATE-2011-HausmansBC #data flow
- Resynchronization of Cyclo-Static Dataflow graphs (JPHMH, MJGB, HC), pp. 1315–1320.
- PPoPP-2011-GrossetZLVH
- Evaluating graph coloring on GPUs (AVPG, PZ, SL, SV, MWH), pp. 297–298.
- PPoPP-2011-HongKOO #algorithm
- Accelerating CUDA graph algorithms at maximum warp (SH, SKK, TO, KO), pp. 267–276.
- FASE-2011-EhrigET #using #version control
- A Formal Resolution Strategy for Operation-Based Conflicts in Model Versioning Using Graph Modifications (HE, CE, GT), pp. 202–216.
- FASE-2011-ZhangZL #api #complexity
- Flow-Augmented Call Graph: A New Foundation for Taming API Complexity (QZ, WZ, MRL), pp. 386–400.
- STOC-2011-BodirskyP #theorem
- Schaefer’s theorem for graphs (MB, MP), pp. 655–664.
- STOC-2011-ChristianoKMST #approximate #performance
- Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs (PC, JAK, AM, DAS, SHT), pp. 273–282.
- STOC-2011-Chuzhoy #algorithm #problem
- An algorithm for the graph crossing number problem (JC), pp. 303–312.
- STOC-2011-DemaineHK #algorithm #composition
- Contraction decomposition in h-minor-free graphs and algorithmic applications (EDD, MH, KiK), pp. 441–450.
- STOC-2011-FungHHP #framework
- A general framework for graph sparsification (WSF, RH, NJAH, DP), pp. 71–80.
- STOC-2011-ItalianoNSW #algorithm
- Improved algorithms for min cut and max flow in undirected planar graphs (GFI, YN, PS, CWN), pp. 313–322.
- STOC-2011-KawarabayashiW #algorithm #composition #proving
- A simpler algorithm and shorter proof for the graph minor decomposition (KiK, PW), pp. 451–458.
- STOC-2011-NewmanS
- Every property of hyperfinite graphs is testable (IN, CS), pp. 675–684.
- CSL-2011-Kartzow #automaton
- A Pumping Lemma for Collapsible Pushdown Graphs of Level 2 (AK), pp. 322–336.
- SAT-2011-HeuleJB #performance
- Efficient CNF Simplification Based on Binary Implication Graphs (MH, MJ, AB), pp. 201–215.
- SAT-2011-SpeckenmeyerWP #approach #satisfiability
- A Satisfiability-Based Approach for Embedding Generalized Tanglegrams on Level Graphs (ES, AW, SP), pp. 134–144.
- ECDL-2010-MarianLRV #ranking
- Citation Graph Based Ranking in Invenio (LM, JYL, MR, MV), pp. 236–247.
- HT-2010-CartledgeN #analysis
- Analysis of graphs for digital preservation suitability (CLC, MLN), pp. 109–118.
- SIGMOD-2010-AchiezraGKS #keyword
- Exploratory keyword search on data graphs (HA, KG, BK, YS), pp. 1163–1166.
- SIGMOD-2010-ChenWHY #in the cloud #scalability
- Large graph processing in the cloud (RC, XW, BH, MY), pp. 1123–1126.
- SIGMOD-2010-JinBXCC #database #named #query #towards #visual notation
- GBLENDER: towards blending visual query formulation and query processing in graph databases (CJ, SSB, XX, JC, BC), pp. 111–122.
- SIGMOD-2010-JinHWRX #constraints #database #reachability
- Computing label-constraint reachability in graph databases (RJ, HH, HW, NR, YX), pp. 123–134.
- SIGMOD-2010-JinYW #classification #named #using
- GAIA: graph classification using evolutionary computation (NJ, CY, WW), pp. 879–890.
- SIGMOD-2010-KhanYW #mining #proximity #scalability #towards
- Towards proximity pattern mining in large graphs (AK, XY, KLW), pp. 867–878.
- SIGMOD-2010-MalewiczABDHLC #named #scalability
- Pregel: a system for large-scale graph processing (GM, MHA, AJCB, JCD, IH, NL, GC), pp. 135–146.
- SIGMOD-2010-MortonBG #named #pipes and filters
- ParaTimer: a progress indicator for MapReduce DAGs (KM, MB, DG), pp. 507–518.
- SIGMOD-2010-TaoSL
- Finding maximum degrees in hidden bipartite graphs (YT, CS, JL), pp. 891–902.
- SIGMOD-2010-Wei #named #performance #query
- TEDI: efficient shortest path query answering on graphs (FW0), pp. 99–110.
- VLDB-2010-AggarwalLYJ #mining #on the
- On Dense Pattern Mining in Graph Streams (CCA, YL, PSY, RJ), pp. 975–984.
- VLDB-2010-FanLMTWW #pattern matching #polynomial
- Graph Pattern Matching: From Intractable to Polynomial Time (WF, JL, SM, NT, YW, YW), pp. 264–275.
- VLDB-2010-FanLMWW #morphism
- Graph Homomorphism Revisited for Graph Matching (WF, JL, SM, HW, YW), pp. 1161–1172.
- VLDB-2010-HanLPY #framework #named
- iGraph: A Framework for Comparisons of Disk-Based Graph Indexing Techniques (WSH, JL, MDP, JXY), pp. 449–459.
- VLDB-2010-MacropolS #clustering #scalability
- Scalable Discovery of Best Clusters on Large Graphs (KM, AKS), pp. 693–702.
- VLDB-2010-PotamiasBGK #nearest neighbour #nondeterminism
- k-Nearest Neighbors in Uncertain Graphs (MP, FB, AG, GK), pp. 997–1008.
- VLDB-2010-WickMM #database #probability #scalability
- Scalable Probabilistic Databases with Factor Graphs and MCMC (MLW, AM, GM), pp. 794–804.
- VLDB-2010-YildirimCZ #named #reachability #scalability
- GRAIL: Scalable Reachability Index for Large Graphs (HY, VC, MJZ), pp. 276–284.
- VLDB-2010-ZhangYJ #approximate #named #scalability
- SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs (SZ, JY, WJ), pp. 1185–1194.
- VLDB-2010-ZhaoH #network #on the #optimisation #query #scalability
- On Graph Query Optimization in Large Networks (PZ, JH), pp. 340–351.
- VLDB-2011-RiceT10 #network #query #strict
- Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions (MNR, VJT), pp. 69–80.
- VLDB-2011-WangZTT10 #on the
- On Triangulation-based Dense Neighborhood Graphs Discovery (NW, JZ, KLT, AKHT), pp. 58–68.
- ITiCSE-2010-Kasyanov #tool support
- Support tools for graphs in computer science (VNK), p. 315.
- ICPC-2010-ChenR #case study #dependence #feature model #using
- Case Study of Feature Location Using Dependence Graph, after 10 Years (KC, VR), pp. 1–3.
- ICSM-2010-BhattacharyaN #debugging #fine-grained #incremental #learning #multi
- Fine-grained incremental learning and multi-feature tossing graphs to improve bug triaging (PB, IN), pp. 1–10.
- ICSM-2010-LiQJW #automation #generative #testing
- Automatic test case selection and generation for regression testing of composite service based on extensible BPEL flow graph (BL, DQ, SJ, DW), pp. 1–10.
- ICSM-2010-SaleckerG #testing #using
- Pairwise test set calculation using k-partite graphs (ES, SG), pp. 1–5.
- SCAM-2010-AllierVDS #metric
- Deriving Coupling Metrics from Call Graphs (SA, SV, BD, HAS), pp. 43–52.
- CIAA-2010-EpifanioFGMS #lazy evaluation #on the
- On Lazy Representations and Sturmian Graphs (CE, CF, AG, FM, JS), pp. 125–134.
- CIAA-2010-Neider #automation #game studies #reachability
- Reachability Games on Automatic Graphs (DN), pp. 222–230.
- DLT-2010-HalldorssonKP #word
- Graphs Capturing Alternations in Words (MMH, SK, AVP), pp. 436–437.
- DLT-2010-HauboldLM #morphism #problem #word
- Compressed Conjugacy and the Word Problem for Outer Automorphism Groups of Graph Groups (NH, ML, CM), pp. 218–230.
- ICALP-v1-2010-CaiCL #morphism #theorem
- Graph Homomorphisms with Complex Values: A Dichotomy Theorem (JyC, XC, PL), pp. 275–286.
- ICALP-v1-2010-Georgiadis #testing
- Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s-t Paths in Digraphs (LG), pp. 738–749.
- ICALP-v1-2010-KoblerKLV #canonical #representation
- Interval Graphs: Canonical Representation in Logspace (JK, SK, BL, OV), pp. 384–395.
- ICALP-v1-2010-RueST #programming
- Dynamic Programming for Graphs on Surfaces (JR, IS, DMT), pp. 372–383.
- ICALP-v2-2010-ChechikEPP #reliability
- Sparse Reliable Graph Backbones (SC, YE, BPS, DP), pp. 261–272.
- SEFM-2010-BarrosCHP #slicing
- Assertion-based Slicing and Slice Graphs (JBB, DCdC, PRH, JSP), pp. 93–102.
- SEFM-2010-GoldsmithC
- Refinement-Friendly Bigraphs and Spygraphs (MG, SC), pp. 203–207.
- AIIDE-2010-FurtakB #complexity #game studies #on the
- On the Complexity of Two-Player Attrition Games Played on Graphs (TF, MB).
- GT-VMT-2010-BlumeBK #invariant
- Recognizable Graph Languages for Checking Invariants (CB, HJSB, BK).
- GT-VMT-2010-GrohmannM #algebra
- Graph Algebras for Bigraphs (DG, MM).
- GT-VMT-2010-HermannCEK #analysis #equivalence #performance #permutation #petri net
- Efficient Analysis of Permutation Equivalence of Graph Derivations Based on Petri Nets (FH, AC, HE, BK).
- GT-VMT-2010-MolR #on the #order
- On A Graph Formalism for Ordered Edges (MdM, AR).
- ICGT-2010-Blume #verification
- Recognizable Graph Languages for the Verification of Dynamic Systems (CB), pp. 384–387.
- ICGT-2010-Jurack #emf #inheritance #modelling
- Composite EMF Modeling Based on Typed Graphs with Inheritance and Containment Structures (SJ), pp. 397–399.
- ICGT-2010-JurackT #component #concept #inheritance
- A Component Concept for Typed Graphs with Inheritance and Containment Structures (SJ, GT), pp. 187–202.
- ICGT-2010-PoskittP #calculus #hoare #source code
- A Hoare Calculus for Graph Programs (CMP, DP), pp. 139–154.
- ICGT-2010-Radke #correctness #source code
- Correctness of Graph Programs Relative to HR + Conditions (HR), pp. 410–412.
- ICGT-2010-TaentzerELW #detection #version control
- Conflict Detection for Model Versioning Based on Graph Modifications (GT, CE, PL, MW), pp. 171–186.
- CHI-2010-McGookinRB #interactive #using
- Clutching at straws: using tangible interaction to provide non-visual access to graphs (DKM, ER, SAB), pp. 1715–1724.
SOFTVIS-2010-MedaniHBKLMPSY #visualisation- Graph works — pilot graph theory visualization tool (DM, GH, CB, PK, NL, TM, SP, RS, AY), pp. 205–206.
- CAiSE-2010-LyRD #design #information management #verification
- Design and Verification of Instantiable Compliance Rule Graphs in Process-Aware Information Systems (LTL, SRM, PD), pp. 9–23.
- ICEIS-DISI-2010-Chein #information management #reasoning #representation
- Graph-based Knowledge Representation and Reasoning (MC), pp. 17–21.
- ICEIS-ISAS-2010-ArtignanH #named #tool support #visualisation
- STOOG — Style-Sheets-based Toolkit for Graph Visualization (GA, MH), pp. 123–131.
- CIKM-2010-CaiP #named #query #reachability #scalability
- Path-hop: efficiently indexing large graphs for reachability queries (JC, CKP), pp. 119–128.
- CIKM-2010-ChengOWZ #named #web #web service
- WS-GraphMatching: a web service tool for graph matching (QC, MO, JW, AZ), pp. 1949–1950.
- CIKM-2010-DeyJ #approach #database #query #reachability #scalability
- A hierarchical approach to reachability query answering in very large graph databases (SKD, HMJ), pp. 1377–1380.
- CIKM-2010-GaoQJWY #performance
- Fast top-k simple shortest paths discovery in graphs (JG, HQ, XJ, TW, DY), pp. 509–518.
- CIKM-2010-GubichevBSW #estimation #performance #scalability
- Fast and accurate estimation of shortest paths in large graphs (AG, SJB, SS, GW), pp. 499–508.
- CIKM-2010-HuangSN #query #refinement #using #word
- Query model refinement using word graphs (YH, LS, JYN), pp. 1453–1456.
- CIKM-2010-PobleteBMB #image #query #retrieval #semantic gap #using #web
- Visual-semantic graphs: using queries to reduce the semantic gap in web image retrieval (BP, BB, MM, JMB), pp. 1553–1556.
- CIKM-2010-SongH #independence #rdf
- Domain-independent entity coreference in RDF graphs (DS, JH), pp. 1821–1824.
- CIKM-2010-SunPL
- Support elements in graph structured schema reintegration (XS, RP, MKL), pp. 1361–1364.
- CIKM-2010-ZhangLY #named
- SUMMA: subgraph matching in massive graphs (SZ, SL, JY), pp. 1285–1288.
- CIKM-2010-ZhengGYXBSHY #community #interactive #topic
- A topical link model for community discovery in textual interaction graph (GZ, JG, LY, SX, SB, ZS, DH, YY), pp. 1613–1616.
- ICML-2010-Cesa-BianchiGVZ #predict #random
- Random Spanning Trees and the Prediction of Weighted Graphs (NCB, CG, FV, GZ), pp. 175–182.
- ICML-2010-GavishNC #learning #multi #theory and practice
- Multiscale Wavelets on Trees, Graphs and High Dimensional Data: Theory and Applications to Semi Supervised Learning (MG, BN, RRC), pp. 367–374.
- ICML-2010-LiuHC #learning #scalability
- Large Graph Construction for Scalable Semi-Supervised Learning (WL, JH, SFC), pp. 679–686.
- ICML-2010-LiuNLL #analysis #learning #relational
- Learning Temporal Causal Graphs for Relational Time-Series Analysis (YL, ANM, ACL, YL), pp. 687–694.
- ICML-2010-LiuY #robust
- Robust Graph Mode Seeking by Graph Shift (HL, SY), pp. 671–678.
- ICML-2010-TingHJ #analysis #convergence
- An Analysis of the Convergence of Graph Laplacians (DT, LH, MIJ), pp. 1079–1086.
- ICPR-2010-AslanAFRAX #3d #segmentation #using
- 3D Vertebral Body Segmentation Using Shape Based Graph Cuts (MSA, AMA, AAF, HMR, BA, PX), pp. 3951–3954.
- ICPR-2010-BaldacciBD #3d #algorithm #bound #design #framework #segmentation
- Oriented Boundary Graph: A Framework to Design and Implement 3D Segmentation Algorithms (FB, AJPB, JPD), pp. 1116–1119.
- ICPR-2010-BardajiFS #distance #edit distance
- Computing the Barycenter Graph by Means of the Graph Edit Distance (IB, MF, AS), pp. 962–965.
- ICPR-2010-BauerEOBKFHN #approach #bound #estimation #performance #robust
- A Fast and Robust Graph-Based Approach for Boundary Estimation of Fiber Bundles Relying on Fractional Anisotropy Maps (MHAB, JE, TO, SB, JK, BF, HKH, CN), pp. 4016–4019.
- ICPR-2010-BonevEGB #feature model
- Information-theoretic Feature Selection from Unattributed Graphs (BB, FE, DG, SB), pp. 930–933.
- ICPR-2010-ChenF #learning
- Semi-supervised Graph Learning: Near Strangers or Distant Relatives (WC, GF), pp. 3368–3371.
- ICPR-2010-ChowdhuryCGR #using #video
- Cell Tracking in Video Microscopy Using Bipartite Graph Matching (ASC, RC, MG, NR), pp. 2456–2459.
- ICPR-2010-CordellaSMS #order #traversal
- Writing Order Recovery from Off-Line Handwriting by Graph Traversal (LPC, CDS, AM, AS), pp. 1896–1899.
- ICPR-2010-FerrerB #algorithm #approximate
- An Iterative Algorithm for Approximate Median Graph Computation (MF, HB), pp. 1562–1565.
- ICPR-2010-FreireCF #approach #generative #problem
- A Column Generation Approach for the Graph Matching Problem (ASF, RMCJ, CEF), pp. 1088–1091.
- ICPR-2010-HaugeardPG #image #kernel #retrieval #taxonomy
- Kernel on Graphs Based on Dictionary of Paths for Image Retrieval (JEH, SPF, PHG), pp. 2965–2968.
- ICPR-2010-IgelmoSF #representation
- A Conductance Electrical Model for Representing and Matching Weighted Undirected Graphs (MI, AS, MF), pp. 958–961.
- ICPR-2010-JainO #consistency
- Consistent Estimator of Median and Mean Graph (BJJ, KO), pp. 1032–1035.
- ICPR-2010-JouiliTL #algorithm #clustering
- Median Graph Shift: A New Clustering Algorithm for Graph Domain (SJ, ST, VL), pp. 950–953.
- ICPR-2010-LeeCL #algorithm #data-driven #markov #monte carlo #using
- A Graph Matching Algorithm Using Data-Driven Markov Chain Monte Carlo Sampling (JL, MC, KML), pp. 2816–2819.
- ICPR-2010-LeskoKNGTVV #segmentation
- Live Cell Segmentation in Fluorescence Microscopy via Graph Cut (ML, ZK, AN, IG, ZT, LVJ, LV), pp. 1485–1488.
- ICPR-2010-RevaudLAB #learning #performance #recognition #robust
- Learning an Efficient and Robust Graph Matching Procedure for Specific Object Recognition (JR, GL, YA, AB), pp. 754–757.
- ICPR-2010-RichiardiVRB #classification #sequence
- Vector Space Embedding of Undirected Graphs with Fixed-cardinality Vertex Sequences for Classification (JR, DVDV, KR, HB), pp. 902–905.
- ICPR-2010-SanromaAS #approach #using
- A Discrete Labelling Approach to Attributed Graph Matching Using SIFT Features (GS, RA, FS), pp. 954–957.
- ICPR-2010-WangLR #clustering
- Combining Real and Virtual Graphs to Enhance Data Clustering (LW, CL, KR), pp. 790–793.
- ICPR-2010-ZhangK10a #detection #using
- Text Detection Using Edge Gradient and Graph Spectrum (JZ, RK), pp. 3979–3982.
- ICPR-2010-ZhangYWWXHY #multi #recognition
- Multi-class Graph Boosting with Subgraph Sharing for Object Recognition (BZ, GY, YW, WW, JX, GH, YY), pp. 1541–1544.
- ICPR-2010-ZhouZP #approach #named
- Lipreading: A Graph Embedding Approach (ZZ, GZ, MP), pp. 523–526.
- KDD-2010-FeiH #classification #functional
- Boosting with structure information in the functional space: an application to graph classification (HF, JH), pp. 643–652.
- KDD-2010-HeFLC #parallel #scalability
- Parallel SimRank computation on large graphs with iterative aggregation (GH, HF, CL, HC), pp. 543–552.
- KDD-2010-HendersonEFALMPT #approach #forensics #metric #mining #multi
- Metric forensics: a multi-level approach for mining volatile graphs (KH, TER, CF, LA, LL, KM, BAP, HT), pp. 163–172.
- KDD-2010-KongY #classification #feature model
- Semi-supervised feature selection for graph classification (XK, PSY), pp. 793–802.
- KDD-2010-MaxwellBR #memory management #mining #using
- Diagnosing memory leaks using graph mining on heap dumps (EKM, GB, NR), pp. 115–124.
- KDD-2010-RothBDFHLLMM #social #using
- Suggesting friends using the implicit social graph (MR, ABD, DD, GF, IH, AL, NL, YM, RM), pp. 233–242.
- KDD-2010-SarkarM #nearest neighbour #performance
- Fast nearest-neighbor search in disk-resident graphs (PS, AWM), pp. 513–522.
- KDD-2010-TanTSLW #social
- Social action tracking via noise tolerant time-varying factor graphs (CT, JT, JS, QL, FW), pp. 1049–1058.
- KDD-2010-XiangYZCZYS #recommendation
- Temporal recommendation on graphs via long- and short-term preference fusion (LX, QY, SZ, LC, XZ, QY, JS), pp. 723–732.
- KDD-2010-ZouGL #database #nondeterminism #probability #semantics
- Discovering frequent subgraphs over uncertain graph databases under probabilistic semantics (ZZ, HG, JL), pp. 633–642.
- KDIR-2010-KKD #keyword #rdf
- Answer Graph Construction for Keyword Search on Graph Structured(RDF) Data (PK, SPK, DD), pp. 162–167.
- KDIR-2010-MuA #classification #multi
- Proximity-based Graph Embeddings for Multi-label Classification (TM, SA), pp. 74–84.
- KR-2010-Li #representation
- A Layered Graph Representation for Complex Regions (SL).
- RecSys-2010-DesarkarSM #collaboration #predict #rating
- Aggregating preference graphs for collaborative rating prediction (MSD, SS, PM), pp. 21–28.
- RecSys-2010-MoldvayBFS #clustering #named #recommendation #semantics #social
- Tagmantic: a social recommender service based on semantic tag graphs and tag clusters (JM, IB, AF, MS), pp. 345–346.
- SIGIR-2010-BordinoCDG #query #similarity
- Query similarity by projecting the query-flow graph (IB, CC, DD, AG), pp. 515–522.
- SIGIR-2010-PhamMM #categorisation #image #modelling #visual notation
- Spatial relationships in visual graph modeling for image categorization (TTP, PM, LM), pp. 729–730.
- ICMT-2010-VoigtH #distance #edit distance #metamodelling
- Metamodel Matching Based on Planar Graph Edit Distance (KV, TH), pp. 245–259.
PLEASE-2010-MamanB #named #product line #towards- SPLGraph: towards a graph-based formalism for software product lines (IM, GB), pp. 40–47.
- OOPSLA-2010-NguyenNWNKN #adaptation #api #approach
- A graph-based approach to API usage adaptation (HAN, TTN, GWJ, ATN, MK, TNN), pp. 302–321.
- LOPSTR-2010-DanvyZ #combinator #reduction
- Three Syntactic Theories for Combinatory Graph Reduction (OD, IZ), pp. 1–20.
- LOPSTR-2010-GiorginoSMP #algorithm #verification
- Verification of the Schorr-Waite Algorithm — From Trees to Graphs (MG, MS, RM, MP), pp. 67–83.
- LOPSTR-2010-LlorensOST #csp #generative #process
- Graph Generation to Statically Represent CSP Processes (ML, JO, JS, ST), pp. 52–66.
- PPDP-2010-TekleGL #datalog #optimisation #query
- Graph queries through datalog optimizations (KTT, MG, YAL), pp. 25–34.
- ASE-2010-Letarte #analysis #interprocedural #model checking #precise #representation
- Model checking graph representation of precise boolean inter-procedural flow analysis (DL), pp. 511–516.
- ASE-2010-WangLCZMY #dependence #query
- Matching dependence-related queries in the system dependence graph (XW, DL, JC, LZ, HM, JXY), pp. 457–466.
- SAC-2010-CiraciBA #constraints #verification
- Graph-based verification of static program constraints (SC, PvdB, MA), pp. 2265–2272.
- SAC-2010-JanssenPW #similarity
- Estimating node similarity from co-citation in a spatial graph model (JJ, PP, RW), pp. 1329–1333.
- SAC-2010-LeeJL #detection #using
- Detecting metamorphic malwares using code graphs (JL, KJ, HL), pp. 1970–1977.
- SAC-2010-LlorensOST #algorithm #control flow
- An algorithm to generate the context-sensitive synchronized control flow graph (ML, JO, JS, ST), pp. 2144–2148.
- SAC-2010-OssaPSG #algorithm #low cost #predict #web
- Referrer graph: a low-cost web prediction algorithm (BdlO, AP, JS, JAG), pp. 831–838.
- SAC-2010-PortugalR #algorithm #clustering #multi #using
- MSP algorithm: multi-robot patrolling based on territory allocation using balanced graph partitioning (DP, RPR), pp. 1271–1276.
LDTA-2010-CortesiH #dependence #semantics #slicing- Dependence condition graph for semantics-based abstract program slicing (AC, RH), p. 4.
- CGO-2010-OdairaNIKN
- Coloring-based coalescing for graph coloring register allocation (RO, TN, TI, HK, TN), pp. 160–169.
- DAC-2010-LinL
- Double patterning lithography aware gridless detailed routing with innovative conflict graph (YHL, YLL), pp. 398–403.
- DAC-2010-ParkBWM #debugging #locality #named #using
- BLoG: post-silicon bug localization in processors using bug localization graphs (SBP, AB, HW, SM), pp. 368–373.
- DATE-2010-HuanYCM #energy
- Energy-oriented dynamic SPM allocation based on time-slotted Cache conflict graph (WH, ZY, MC, LM), pp. 598–601.
- DATE-2010-IqbalSH10a #estimation #execution #monte carlo #named
- DAGS: Distribution agnostic sequential Monte Carlo scheme for task execution time estimation (NI, MAS, JH), pp. 1645–1648.
- DATE-2010-PerezSF #data flow #optimisation #relational
- Optimizing Data-Flow Graphs with min/max, adding and relational operations (JP, PS, VF), pp. 1361–1364.
- DATE-2010-SrinivasJ #clustering #performance
- Clock gating approaches by IOEX graphs and cluster efficiency plots (JS, SJ), pp. 638–641.
- DATE-2010-WiggersBGB
- Simultaneous budget and buffer size computation for throughput-constrained task graphs (MW, MB, MG, TB), pp. 1669–1672.
- HPDC-2010-LiewAHH #data type #distributed #optimisation #parallel #streaming #towards #using
- Towards optimising distributed data streaming graphs using parallel streams (CSL, MPA, JIvH, LH), pp. 725–736.
- ISMM-2010-BegB #approach
- A graph theoretic approach to cache-conscious placement of data for direct mapped caches (MB, PvB), pp. 113–120.
- PDP-2010-BittencourtSM #algorithm #lookahead #scheduling #using
- DAG Scheduling Using a Lookahead Variant of the Heterogeneous Earliest Finish Time Algorithm (LFB, RS, ERMM), pp. 27–34.
- PDP-2010-SunWC #approach #clustering #coordination #network
- A Graph Clustering Approach to Computing Network Coordinates (YS, BW, KC), pp. 129–136.
ESOP-2010-BlazyRA #verification- Formal Verification of Coalescing Graph-Coloring Register Allocation (SB, BR, AWA), pp. 145–164.
- ESOP-2010-LavironCR
- Separating Shape Graphs (VL, BYEC, XR), pp. 387–406.
- STOC-2010-BateniHM #approximate #bound
- Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth (MB, MH, DM), pp. 211–220.
- STOC-2010-BayatiGT #approach #combinator #random #scalability
- Combinatorial approach to the interpolation method and scaling limits in sparse random graphs (MB, DG, PT), pp. 105–114.
- STOC-2010-DuanP
- Connectivity oracles for failure prone graphs (RD, SP), pp. 465–474.
- STOC-2010-GoelKK
- Perfect matchings in o(n log n) time in regular bipartite graphs (AG, MK, SK), pp. 39–46.
- STOC-2010-KawarabayashiW #algorithm #proving #theorem
- A shorter proof of the graph minor algorithm: the unique linkage theorem (KiK, PW), pp. 687–694.
- STOC-2010-Madry #algorithm #approximate #multi #performance #problem
- Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms (AM), pp. 121–130.
- STOC-2010-RaghavendraS #game studies
- Graph expansion and the unique games conjecture (PR, DS), pp. 755–764.
- STOC-2010-RaghavendraST #approximate #parametricity
- Approximations for the isoperimetric and spectral profile of graphs and related parameters (PR, DS, PT), pp. 631–640.
- CAV-2010-KahlonW #concurrent #debugging #detection #precise #source code
- Universal Causality Graphs: A Precise Happens-Before Model for Detecting Bugs in Concurrent Programs (VK, CW), pp. 434–449.
- ICST-2010-NguyenWR #named
- GraphSeq: A Graph Matching Tool for the Extraction of Mobility Patterns (MDN, HW, NR), pp. 195–204.
- IJCAR-2010-BensaidCP #integer
- Perfect Discrimination Graphs: Indexing Terms with Integer Exponents (HB, RC, NP), pp. 369–383.
- LICS-2010-Grohe #fixpoint #polynomial
- Fixed-Point Definability and Polynomial Time on Graphs with Excluded Minors (MG), pp. 179–188.
- LICS-2010-Laubner #polynomial
- Capturing Polynomial Time on Interval Graphs (BL), pp. 199–208.
- DocEng-2009-Hassan09a #documentation #interactive #named #using
- GraphWrap: a system for interactive wrapping of pdf documents using graph matching techniques (TH), pp. 247–248.
- ICDAR-2009-BodicLAHLK #detection #integer #linear #programming #using
- Symbol Detection Using Region Adjacency Graphs and Integer Linear Programming (PLB, HL, SA, PH, YL, AK), pp. 1320–1324.
- ICDAR-2009-GacebELE #automation #documentation #recognition
- Graph b-Coloring for Automatic Recognition of Documents (DG, VE, FL, HE), pp. 261–265.
- ICDAR-2009-Hassan #documentation #using
- User-Guided Wrapping of PDF Documents Using Graph Matching Techniques (TH), pp. 631–635.
- ICDAR-2009-LuqmanBR #classification #network #recognition #using
- Graphic Symbol Recognition Using Graph Based Signature and Bayesian Network Classifier (MML, TB, JYR), pp. 1325–1329.
- ICDAR-2009-Schambach #recognition
- Recurrent HMMs and Cursive Handwriting Recognition Graphs (MPS), pp. 1146–1150.
- ICDAR-2009-SidereHR #classification #representation
- Vector Representation of Graphs: Application to the Classification of Symbols and Letters (NS, PH, JYR), pp. 681–685.
- JCDL-2009-LiC #approach #kernel #machine learning #predict #recommendation
- Recommendation as link prediction: a graph kernel-based machine learning approach (XL, HC), pp. 213–216.
- SIGMOD-2009-NeumannW #rdf #scalability
- Scalable join processing on very large RDF graphs (TN, GW), pp. 627–640.
- VLDB-2009-AggarwalXY #named
- GConnect: A Connectivity Index for Massive Disk-resident Graphs (CCA, YX, PSY), pp. 862–873.
- VLDB-2009-BrauerBHSMF #documentation #named #retrieval
- RankIE: Document Retrieval on Ranked Entity Graphs (FB, WMB, GH, MS, AM, FF), pp. 1578–1581.
- VLDB-2009-ChenLFCYH #mining #random #summary
- Mining Graph Patterns Efficiently via Randomized Summaries (CC, CXL, MF, MC, XY, JH), pp. 742–753.
- VLDB-2009-CormodeSBK #network #social
- Class-based graph anonymization for social network data (GC, DS, SB, BK), pp. 766–777.
- VLDB-2009-HasanZ
- Output Space Sampling for Graph Patterns (MAH, MJZ), pp. 730–741.
- VLDB-2009-ZengTWFZ #approximate #distance #edit distance
- Comparing Stars: On Approximating Graph Edit Distance (ZZ, AKHT, JW, JF, LZ), pp. 25–36.
- VLDB-2009-ZhouCY #clustering
- Graph Clustering Based on Structural/Attribute Similarities (YZ, HC, JXY), pp. 718–729.
- VLDB-2009-ZouCO #database #named #query #scalability
- DistanceJoin: Pattern Match Query In a Large Graph Database (LZ, LC, MTÖ), pp. 886–897.
- ITiCSE-2009-BryfczynskiP #named
- GraphPad: a graph creation tool for CS2/CS7 (SPB, RPP), p. 389.
- CSMR-2009-BittencourtG #algorithm #architecture #clustering #comparison
- Comparison of Graph Clustering Algorithms for Recovering Software Architecture Module Views (RAB, DDSG), pp. 251–254.
- ICPC-2009-SamiaL #architecture #scalability #towards #visualisation
- Towards pie tree visualization of graphs and large software architectures (MS, ML), pp. 301–302.
- ICPC-2009-SimRC #comprehension #question
- Structure transition graphs: An ECG for program comprehension? (SES, SR, LC), pp. 303–304.
- ICSM-2009-LinZZ #aspectj #incremental
- Incremental call graph reanalysis for AspectJ software (YL, SZ, JZ), pp. 306–315.
- ICSM-2009-WangLSKKL #approach #combinator #navigation #web
- A combinatorial approach to building navigation graphs for dynamic web applications (WW, YL, SS, RK, RK, JL), pp. 211–220.
- WCRE-1999-HigoK99a #clone detection #dependence #detection #quality
- Enhancing Quality of Code Clone Detection with Program Dependency Graph (YH, SK), pp. 315–316.
- WCRE-1999-Kpodjedo99a #approximate #re-engineering
- Approximate Graph Matching in Software Engineering (SK), pp. 295–298.
- CIAA-2009-Fujiyoshi #automaton #recognition
- Recognition of a Spanning Tree of Directed Acyclic Graphs by Tree Automata (AF), pp. 105–114.
- DLT-2009-CampanoniC #control flow
- Traces of Control-Flow Graphs (SC, SCR), pp. 156–169.
- ICALP-v1-2009-AroraSW #case study #towards
- Towards a Study of Low-Complexity Graphs (SA, DS, AW), pp. 119–131.
- ICALP-v1-2009-ChekuriK #reduction
- A Graph Reduction Step Preserving Element-Connectivity and Applications (CC, NK), pp. 254–265.
- ICALP-v1-2009-DemaineHK #algorithm #approximate
- Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs (EDD, MH, KiK), pp. 316–327.
- ICALP-v1-2009-DemaineHK09a
- Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs (EDD, MH, PNK), pp. 328–340.
- ICALP-v1-2009-WeimannY
- Computing the Girth of a Planar Graph in O(n logn) Time (OW, RY), pp. 764–773.
- ICALP-v1-2009-YeB
- Elimination Graphs (YY, AB), pp. 774–785.
- ICALP-v2-2009-AhnG
- Graph Sparsification in the Semi-streaming Model (KJA, SG), pp. 328–338.
- ICALP-v2-2009-CooperIKK #random #using
- Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies (CC, DI, RK, AK), pp. 411–422.
- ICALP-v2-2009-KorulaP #algorithm #problem
- Algorithms for Secretary Problems on Graphs and Hypergraphs (NK, MP), pp. 508–520.
- LATA-2009-Courcelle #algorithm #higher-order #logic #monad
- Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications (BC), pp. 19–22.
- SEFM-2009-DangG #metamodelling #modelling #precise
- Precise Model-Driven Transformations Based on Graphs and Metamodels (DHD, MG), pp. 307–316.
CEFP-2009-TothBHLTK #behaviour #dependence #erlang #impact analysis #source code #using- Impact Analysis of Erlang Programs Using Behaviour Dependency Graphs (MT, IB, ZH, LL, MT, TK), pp. 372–390.
- GT-VMT-2009-BruniL
- Ten virtues of structured graphs (RB, ALL), pp. 3–22.
- CHI-2009-HoltenW #case study #user study #visualisation
- A user study on visualizing directed edges in graphs (DH, JJvW), pp. 2299–2308.
- CHI-2009-Stewarts #sketching
- Graph sketcher: extending illustration to quantitative graphs (RS, MMCS), pp. 1113–1116.
- HCI-NIMT-2009-ItoMT #3d #visualisation
- Sphere Anchored Map: A Visualization Technique for Bipartite Graphs in 3D (TI, KM, JT), pp. 811–820.
- HIMI-DIE-2009-VandrommeDPC #interactive #semantics
- An Interactive System Based on Semantic Graphs (JV, SD, PP, CC), pp. 638–647.
- ICEIS-AIDSS-2009-YangLSKCGP #learning
- Graph Structure Learning for Task Ordering (YY, AL, HS, BK, CMC, RG, KP), pp. 164–169.
- ICEIS-DISI-2009-Chen
- Directed Acyclic Graphs and Disjoint Chains (YC), pp. 17–24.
- CIKM-2009-AnastasakosHKR #approach #collaboration #recommendation #using
- A collaborative filtering approach to ad recommendation using the query-ad click graph (TA, DH, SK, HR), pp. 1927–1930.
- CIKM-2009-BaragliaCDNPS #query
- Aging effects on query flow graphs for query suggestion (RB, CC, DD, FMN, RP, FS), pp. 1947–1950.
- CIKM-2009-ChengKN #performance #query #scalability
- Efficient processing of group-oriented connection queries in a large graph (JC, YK, WN), pp. 1481–1484.
- CIKM-2009-FeiH #kernel
- L2 norm regularized feature kernel regression for graph data (HF, JH), pp. 593–600.
- CIKM-2009-FletcherB #performance #rdf #scalability
- Scalable indexing of RDF graphs for efficient join processing (GHLF, PWB), pp. 1513–1516.
- CIKM-2009-HeLL #learning
- Graph-based transfer learning (JH, YL, RDL), pp. 937–946.
- CIKM-2009-HuangSN #documentation #word
- Smoothing document language model with local word graph (YH, LS, JYN), pp. 1943–1946.
- CIKM-2009-JinYW #classification
- Graph classification based on pattern co-occurrence (NJ, CY, WW), pp. 573–582.
- CIKM-2009-KimPDG #classification #web
- Improving web page classification by label-propagation over click graphs (SMK, PP, LD, SG), pp. 1077–1086.
- CIKM-2009-PattanasriMM #comprehension #named #random
- ComprehEnRank: estimating comprehension in classroom by absorbing random walks on a cognitive graph (NP, MM, MM), pp. 1769–1772.
- CIKM-2009-SunMG #independence #information retrieval #mining
- Independent informative subgraph mining for graph information retrieval (BS, PM, CLG), pp. 563–572.
- CIKM-2009-SunMG09a #learning #online #rank
- Learning to rank graphs for online similar graph search (BS, PM, CLG), pp. 1871–1874.
- CIKM-2009-TongQJF #interactive #named #performance #proximity #query
- iPoG: fast interactive proximity querying on graphs (HT, HQ, HJ, CF), pp. 1673–1676.
- CIKM-2009-ZhengDG #crawling
- Graph-based seed selection for web-scale crawlers (SZ, PD, CLG), pp. 1967–1970.
- CIKM-2009-ZhongL #named #semistructured data
- 3se: a semi-structured search engine for heterogeneous data in graph model (MZ, ML), pp. 1405–1408.
- CIKM-2009-ZouLGZ #mining #nondeterminism
- Frequent subgraph pattern mining on uncertain graph data (ZZ, JL, HG, SZ), pp. 583–592.
- ECIR-2009-Pablo-SanchezM #classification
- Building a Graph of Names and Contextual Patterns for Named Entity Classification (CdPS, PM), pp. 530–537.
- ECIR-2009-PapadopoulosMKB #recommendation
- Lexical Graphs for Improved Contextual Ad Recommendation (SP, FM, YK, BB), pp. 216–227.
- ICML-2009-BuhlerH #clustering
- Spectral clustering based on the graph p-Laplacian (TB, MH), pp. 81–88.
- ICML-2009-DaitchKS
- Fitting a graph to vector data (SID, JAK, DAS), pp. 201–208.
- ICML-2009-JacobOV
- Group lasso with overlap and graph lasso (LJ, GO, JPV), pp. 433–440.
- ICML-2009-JebaraWC #learning
- Graph construction and b-matching for semi-supervised learning (TJ, JW, SFC), pp. 441–448.
- ICML-2009-MesmayRVP #library #optimisation #performance
- Bandit-based optimization on graphs with application to library performance tuning (FdM, AR, YV, MP), pp. 729–736.
- ICML-2009-NowozinJ #clustering #learning #linear #programming
- Solution stability in linear programming relaxations: graph partitioning and unsupervised learning (SN, SJ), pp. 769–776.
- KDD-2009-AsurP #analysis #approach #interactive
- A viewpoint-based approach for interaction graph analysis (SA, SP), pp. 79–88.
- KDD-2009-DengLK #algorithm
- A generalized Co-HITS algorithm and its application to bipartite graphs (HD, MRL, IK), pp. 239–248.
- KDD-2009-LiuKJ #learning #monitoring
- Learning dynamic temporal graphs for oil-production equipment monitoring system (YL, JRK, OJ), pp. 1225–1234.
- KDD-2009-Macskassy #empirical #learning #metric #using
- Using graph-based metrics with empirical risk minimization to speed up active learning on networked data (SAM), pp. 597–606.
- KDD-2009-MaunzHK #mining #refinement #scalability #using
- Large-scale graph mining using backbone refinement classes (AM, CH, SK), pp. 617–626.
- KDD-2009-McGlohonBASF #detection #named
- SNARE: a link analytic system for graph labeling and risk detection (MM, SB, MGA, DMS, CF), pp. 1265–1274.
- KDD-2009-SatuluriP #clustering #community #probability #scalability #using
- Scalable graph clustering using stochastic flows: applications to community discovery (VS, SP), pp. 737–746.
- KDD-2009-TsourakakisKMF #named
- DOULION: counting triangles in massive graphs with a coin (CET, UK, GLM, CF), pp. 837–846.
- KDD-2009-YinLMH #classification #social #web
- Exploring social tagging graph for web object classification (ZY, RL, QM, JH), pp. 957–966.
- KDIR-2009-BalujaRS #classification #performance
- Text Classification through Time — Efficient Label Propagation in Time-Based Graphs (SB, DR, DS), pp. 174–182.
- KEOD-2009-ThwaitesFS
- Chain Event Graph Map Model Selection (PAT, GF, JQS), pp. 392–395.
- MLDM-2009-RiesenB #difference #prototype #reduction #using
- Dissimilarity Based Vector Space Embedding of Graphs Using Prototype Reduction Schemes (KR, HB), pp. 617–631.
- SEKE-2009-MajumdarB
- Separating The Scattered Concerns: A Graph Based Model (DM, SB), pp. 715–720.
- SEKE-2009-RusNSC #algorithm #clustering #fault #using
- Clustering of Defect Reports Using Graph Partitioning Algorithms (VR, XN, SGS, YC), pp. 442–445.
- SEKE-2009-SarkarCCB #concept #multi #specification
- Object Specification Language for Graph Based Conceptual level Multidimensional Data Model (AS, SC, NC, SB), pp. 694–607.
- SIGIR-2009-DengKL #modelling #query #representation
- Entropy-biased models for query representation on the click graph (HD, IK, MRL), pp. 339–346.
- SIGIR-2009-GuanBMCW #multi #personalisation #ranking #recommendation #using
- Personalized tag recommendation using graph-based ranking on multi-type interrelated objects (ZG, JB, QM, CC, CW), pp. 540–547.
- SIGIR-2009-SakumaK #analysis
- Link analysis for private weighted graphs (JS, SK), pp. 235–242.
- SIGIR-2009-SeoJ #precise #retrieval #using
- High precision retrieval using relevance-flow graph (JS, JJ), pp. 694–695.
- SIGIR-2009-YeHL #approach #mining #multi #wiki #word
- A graph-based approach to mining multilingual word associations from wikipedia (ZY, XH, HL), pp. 690–691.
- OOPSLA-2009-PluquetLW #in memory #performance #version control
- Executing code in the past: efficient in-memory object graph versioning (FP, SL, RW), pp. 391–408.
- SAS-2009-WehrleH #model checking
- The Causal Graph Revisited for Directed Model Checking (MW, MH), pp. 86–101.
- ESEC-FSE-2009-JeongKZ #debugging
- Improving bug triage with bug tossing graphs (GJ, SK, TZ), pp. 111–120.
- ESEC-FSE-2009-NguyenNPAN #mining #multi
- Graph-based mining of multiple object usage patterns (TTN, HAN, NHP, JMAK, TNN), pp. 383–392.
- ICSE-2009-PhamNNAN #clone detection #detection #modelling
- Complete and accurate clone detection in graph-based models (NHP, HAN, TTN, JMAK, TNN), pp. 276–286.
- SAC-2009-DungDH #constraints #framework #optimisation
- LS(graph & tree): a local search framework for constraint optimization on graphs and trees (PQD, YD, PVH), pp. 1402–1407.
- SAC-2009-GaoS #performance
- Characterizing 1-dof Henneberg-I graphs with efficient configuration spaces (HG, MS), pp. 1122–1126.
- SAC-2009-HendersonE #scalability
- Applying latent dirichlet allocation to group discovery in large graphs (KH, TER), pp. 1456–1461.
- SAC-2009-KumarZ #clustering #visualisation
- Visualization of clustered directed acyclic graphs with node interleaving (PK, KZ), pp. 1800–1805.
- CASE-2009-AlenljungL #using #verification
- Formal verification of PLC controlled systems using Sensor Graphs (TA, BL), pp. 164–170.
- DAC-2009-Falk
- WCET-aware register allocation based on graph coloring (HF), pp. 726–731.
- DAC-2009-Geilen #data flow #reduction
- Reduction techniques for synchronous dataflow graphs (MG), pp. 911–916.
- DAC-2009-JainC #performance #satisfiability #using
- Efficient SAT solving for non-clausal formulas using DPLL, graphs, and watched cuts (HJ, EMC), pp. 563–568.
- DAC-2009-WangCSC #power management #synthesis #using
- Low power gated bus synthesis using shortest-path Steiner graph for system-on-chip communications (RW, NCC, BS, CKC), pp. 166–171.
- DATE-2009-Gomez-PradoRCGB #data flow #hardware #implementation #optimisation
- Optimizing data flow graphs to minimize hardware implementation (DGP, QR, MJC, JG, EB), pp. 117–122.
- HPDC-2009-QinFP #approach #automation #composition #grid #novel #quality #workflow
- A novel graph based approach for automatic composition of high quality grid workflows (JQ, TF, RP), pp. 167–176.
- HPDC-2009-SaballusF #distributed #maintenance
- Maintaining reference graphs of globally accessible objects in fully decentralized distributed systems (BS, TF), pp. 59–60.
- LCTES-2009-ZouABL #embedded #flexibility #realtime #theory and practice
- PTIDES on flexible task graph: real-time embedded systembuilding from theory to practice (JZ, JSA, DFB, EAL), pp. 31–40.
- PPoPP-2009-KangB #algorithm #memory management #performance #transaction
- An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs (SK, DAB), pp. 15–24.
- PPoPP-2009-YangWXDZ #optimisation
- Comparability graph coloring for optimizing utilization of stream register files in stream processors (XY, LW, JX, YD, YZ), pp. 111–120.
- SOSP-2009-DunaganZS #combinator #named #optimisation #using
- Heat-ray: combating identity snowball attacks using machinelearning, combinatorial optimization and attack graphs (JD, AXZ, DRS), pp. 305–320.
- FASE-2009-HermannEE #inheritance #network #security
- Transformation of Type Graphs with Inheritance for Ensuring Security in E-Government Networks (FH, HE, CE), pp. 325–339.
- FoSSaCS-2009-AntonopoulosD #logic
- Separating Graph Logic from MSO (TA, AD), pp. 63–77.
- STOC-2009-ChalopinG
- Every planar graph is the intersection graph of segments in the plane: extended abstract (JC, DG), pp. 631–638.
- STOC-2009-ChechikLPR #fault tolerance
- Fault-tolerant spanners for general graphs (SC, ML, DP, LR), pp. 435–444.
- STOC-2009-KolaitisK #quantifier #random
- Random graphs and the parity quantifier (PGK, SK), pp. 705–714.
- STOC-2009-LeeS #geometry #on the
- On the geometry of graphs with a forbidden minor (JRL, AS), pp. 245–254.
CADE-2009-KorpM #dependence- Beyond Dependency Graphs (MK, AM), pp. 339–354.
- ICST-2009-GligoricGLMK #generative #java #optimisation
- Optimizing Generation of Object Graphs in Java PathFinder (MG, TG, SL, DM, SK), pp. 51–60.
ISSTA-2009-ChengLZWY #debugging #identification #mining #using- Identifying bug signatures using discriminative graph mining (HC, DL, YZ, XW, XY), pp. 141–152.
- LICS-2009-Tan #automaton #infinity #reachability
- Graph Reachability and Pebble Automata over Infinite Alphabets (TT), pp. 157–166.
MBT-2009-SchumannSH #nondeterminism #testing #using- Computing Optimal Tests for Non-deterministic Systems Using DNNF Graphs (AS, MS, JH), pp. 87–99.
WICSA-2008-ChangMQ #architecture #configuration management #formal method #towards- Towards a Formal Model for Reconfigurable Software Architectures by Bigraphs (ZC, XM, ZQ), pp. 331–334.
- DocEng-2008-Al-SaffarH #semantics
- Semantic impact graphs for information valuation (SAS, GLH), pp. 209–212.
- DRR-2008-GacebELE #locality
- Address block localization based on graph theory (DG, VE, FL, HE), p. 68150.
- PODS-2008-SarmaGP #rank
- Estimating PageRank on graph streams (ADS, SG, RP), pp. 69–78.
- SIGMOD-2008-BollackerEPST #database #named
- Freebase: a collaboratively created graph database for structuring human knowledge (KDB, CE, PP, TS, JT), pp. 1247–1250.
- SIGMOD-2008-GolenbergKS #keyword #proximity
- Keyword proximity search in complex data graphs (KG, BK, YS), pp. 927–940.
- SIGMOD-2008-GouC #algorithm #pattern matching #performance
- Efficient algorithms for exact ranked twig-pattern matching over graphs (GG, RC), pp. 581–594.
- SIGMOD-2008-HeS #data access #database #named #query
- Graphs-at-a-time: query language and access methods for graph databases (HH, AKS), pp. 405–418.
- SIGMOD-2008-JinXRW #query #reachability #scalability
- Efficiently answering reachability queries on very large directed graphs (RJ, YX, NR, HW), pp. 595–608.
- SIGMOD-2008-LiuT #towards
- Towards identity anonymization on graphs (KL, ET), pp. 93–106.
- SIGMOD-2008-NavlakhaRS #bound #fault #summary
- Graph summarization with bounded error (SN, RR, NS), pp. 419–432.
- SIGMOD-2008-TianHP #performance #summary
- Efficient aggregation for graph summarization (YT, RAH, JMP), pp. 567–580.
- SIGMOD-2008-VuOPT #database #keyword
- A graph method for keyword-based selection of the top-K databases (QHV, BCO, DP, AKHT), pp. 915–926.
- SIGMOD-2008-YanCHY #mining
- Mining significant graph patterns by leap search (XY, HC, JH, PSY), pp. 433–444.
- VLDB-2008-AntonellisGC #analysis #query
- Simrank++: query rewriting through link analysis of the click graph (IA, HGM, CCC), pp. 408–421.
- VLDB-2008-CormodeSYZ #using
- Anonymizing bipartite graph data using safe groupings (GC, DS, TY, QZ), pp. 833–844.
- VLDB-2008-DalviKS #keyword #memory management
- Keyword search on external memory data graphs (BBD, MK, SS), pp. 1189–1204.
- VLDB-2008-TianPNMK #named #query #tool support
- Periscope/GQ: a graph querying toolkit (YT, JMP, VN, SM, MK), pp. 1404–1407.
- EDM-2008-LynchAPA #classification #programming #search-based
- Argument graph classification with Genetic Programming and C4.5 (CL, KDA, NP, VA), pp. 137–146.
- ICPC-2008-Quante #comprehension #empirical #process
- Do Dynamic Object Process Graphs Support Program Understanding? — A Controlled Experiment (JQ), pp. 73–82.
- ICSM-2008-LinZKM #editing #visualisation
- A domain-customizable SVG-based graph editor for software visualizations (TL, FZ, HMK, HAM), pp. 466–467.
- SCAM-2008-GermanRH #impact analysis
- Change Impact Graphs: Determining the Impact of Prior Code Changes (DMG, GR, AEH), pp. 184–193.
- SCAM-2008-ScholzZC #analysis #dependence #reachability
- User-Input Dependence Analysis via Graph Reachability (BS, CZ, CC), pp. 25–34.
- WCRE-2008-KpodjedoRGA #evolution #fault
- Error Correcting Graph Matching Application to Software Evolution (SK, FR, PG, GA), pp. 289–293.
- AFL-2008-KuskeL #automation #recursion
- Euler paths and ends in automatic and recursive graphs (DK, ML), pp. 245–256.
- ICALP-A-2008-AvinKL #evolution #how #random
- How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs) (CA, MK, ZL), pp. 121–132.
- ICALP-A-2008-BaswanaGSU #constant #distance #fault #polynomial
- Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error (SB, AG, SS, JU), pp. 609–621.
- ICALP-A-2008-BjorklundHKK #bound #problem
- The Travelling Salesman Problem in Bounded Degree Graphs (AB, TH, PK, MK), pp. 198–209.
- ICALP-A-2008-BlellochVW #approach #combinator #problem
- A New Combinatorial Approach for Sparse Graph Problems (GEB, VV, RW), pp. 108–120.
- ICALP-A-2008-BorradaileK #network #problem
- The Two-Edge Connectivity Survivable Network Problem in Planar Graphs (GB, PNK), pp. 485–501.
- ICALP-A-2008-CheboluFM #random
- Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected Time (PC, AMF, PM), pp. 161–172.
- ICALP-A-2008-ChierichettiV
- The Local Nature of List Colorings for Graphs of High Girth (FC, AV), pp. 320–332.
- ICALP-A-2008-Courcelle #aspect-oriented #higher-order #logic #monad
- Graph Structure and Monadic Second-Order Logic: Language Theoretical Aspects (BC), pp. 1–13.
- ICALP-A-2008-DraganFG
- Spanners in Sparse Graphs (FFD, FVF, PAG), pp. 597–608.
- ICALP-A-2008-KaleS #bound
- An Expansion Tester for Bounded Degree Graphs (SK, CS), pp. 527–538.
- ICALP-A-2008-YoshidaI #testing
- Property Testing on k-Vertex-Connectivity of Graphs (YY, HI), pp. 539–550.
- LATA-2008-BrijderH #assembly
- Extending the Overlap Graph for Gene Assembly in Ciliates (RB, HJH), pp. 137–148.
- RTA-2008-MazanekM #combinator #functional #parsing
- Functional-Logic Graph Parser Combinators (SM, MM), pp. 261–275.
- ICFP-2008-AdamsD #performance #similarity
- Efficient nondestructive equality checking for trees and graphs (MDA, RKD), pp. 179–188.
- GT-VMT-2008-AzabP #c++ #source code #type checking
- Type Checking C++ Template Instantiation by Graph Programs (KA, KHP).
- GT-VMT-2008-GrohmannM #resource management
- Controlling resource access in Directed Bigraphs (DG, MM).
- GT-VMT-2008-MazanekM #combinator #parsing
- Parsing of Hyperedge Replacement Grammars with Graph Parser Combinators (SM, MM).
- GT-VMT-2008-RensinkK #diagrams #on the #semantics #uml
- On a Graph-Based Semantics for UML Class and Object Diagrams (AR, AK).
- GT-VMT-2008-Weinell #query #reduction
- Extending Graph Query Languages by Reduction (EW).
- GT-VMT-2008-Xing #representation
- A Graph-Based Type Representation for Objects (CCX).
- ICGT-2008-BauerBKR #abstraction
- A Modal-Logic Based Graph Abstraction (JB, IB, MEK, AR), pp. 321–335.
- ICGT-2008-BrugginkK #on the
- On the Recognizability of Arrow and Graph Languages (HJSB, BK), pp. 336–350.
- ICGT-2008-CenciarelliGT #bisimulation #network
- Network Applications of Graph Bisimulation (PC, DG, ET), pp. 131–146.
- ICGT-2008-ChalopinMM #problem
- Labelled (Hyper)Graphs, Negotiations and the Naming Problem (JC, AWM, YM), pp. 54–68.
- ICGT-2008-DerbelMG #implementation #mobile
- Mobile Agents Implementing Local Computations in Graphs (BD, MM, SG), pp. 99–114.
- ICGT-2008-DrewesHM #adaptation #modelling
- Adaptive Star Grammars for Graph Models (FD, BH, MM), pp. 442–457.
- ICGT-2008-EhrigE #correctness #model transformation #semantics #using
- Semantical Correctness and Completeness of Model Transformations Using Graph and Rule Transformation (HE, CE), pp. 194–210.
- ICGT-2008-EhrigP #analysis #formal method #kernel #model transformation
- Formal Analysis of Model Transformations Based on Triple Graph Rules with Kernels (HE, UP), pp. 178–193.
- ICGT-2008-Grohmann #encryption #security
- Security, Cryptography and Directed Bigraphs (DG), pp. 487–489.
- ICGT-2008-JelinkovaK #on the
- On Switching to H-Free Graphs (EJ, JK), pp. 379–395.
- ICGT-2008-KreowskiK #framework #parallel
- Graph Multiset Transformation as a Framework for Massively Parallel Computation (HJK, SK), pp. 351–365.
- ICGT-2008-Orejas #constraints
- Attributed Graph Constraints (FO), pp. 274–288.
- ICGT-2008-RensinkG #contest #tool support
- Graph-Based Tools: The Contest (AR, PVG), pp. 463–466.
- ICGT-2008-Weinell
- Transformation-Based Operationalization of Graph Languages (EW), pp. 520–522.
- SOFTVIS-2008-DietrichYMJD #analysis #clustering #dependence #java
- Cluster analysis of Java dependency graphs (JD, VY, CM, GJ, MD), pp. 91–94.
- SOFTVIS-2008-ParduhnSW #algorithm #using #visualisation
- Algorithm visualization using concrete and abstract shape graphs (SAP, RS, RW), pp. 33–36.
- SOFTVIS-2008-PichNR #analysis #dependence #visual notation
- Visual analysis of importance and grouping in software dependency graphs (CP, LN, GGR), pp. 29–32.
- SOFTVIS-2008-ZeckzerKSHK #3d #clustering #communication #reliability #using #visualisation
- Analyzing the reliability of communication between software entities using a 3D visualization of clustered graphs (DZ, RK, LS, HH, TK), pp. 37–46.
- EDOC-2008-SommestadEJ #analysis #architecture #enterprise #modelling #security
- Combining Defense Graphs and Enterprise Architecture Models for Security Analysis (TS, ME, PJ), pp. 349–355.
- ICEIS-ISAS2-2008-BainaT #algorithm #hybrid #towards #verification #workflow
- Toward a Hybrid Algorithm for Workflow Graph Structural Verification (FT, KB, WG), pp. 442–447.
- CIKM-2008-BoldiBCDGV
- The query-flow graph: model and applications (PB, FB, CC, DD, AG, SV), pp. 609–618.
- CIKM-2008-ChenLYH #approach #effectiveness #on the
- On effective presentation of graph patterns: a structural representative approach (CC, CXL, XY, JH), pp. 299–308.
- CIKM-2008-DaoudTB #ontology #personalisation #using
- Using a graph-based ontological user profile for personalizing search (MD, LTL, MB), pp. 1495–1496.
- CIKM-2008-FanWLZH #effectiveness #framework #named
- GHOST: an effective graph-based framework for name distinction (XF, JW, BL, LZ, WH), pp. 1449–1450.
- CIKM-2008-FeiH #classification #feature model
- Structure feature selection for graph classification (HF, JH), pp. 991–1000.
- CIKM-2008-HerschelN #detection #scalability
- Scaling up duplicate detection in graph data (MH, FN), pp. 1325–1326.
- CIKM-2008-Ibekwe-SanjuanSV #composition #information management
- Decomposition of terminology graphs for domain knowledge acquisition (FIS, ES, MSEV), pp. 1463–1464.
- CIKM-2008-ModaniD #clique #scalability
- Large maximal cliques enumeration in sparse graphs (NM, KD), pp. 1377–1378.
- CIKM-2008-PobleteCG
- Dr. Searcher and Mr. Browser: a unified hyperlink-click graph (BP, CC, AG), pp. 1123–1132.
- ECIR-2008-HannahMO #analysis
- Analysis of Link Graph Compression Techniques (DH, CM, IO), pp. 596–601.
- ECIR-2008-NaderiR #evaluation #similarity
- Graph-Based Profile Similarity Calculation Method and Evaluation (HN, BR), pp. 637–641.
- ECIR-2008-StathopoulosUJ #automation #image #multi #semantics
- Semantic Relationships in Multi-modal Graphs for Automatic Image Annotation (VS, JU, JMJ), pp. 490–497.
- ECIR-2008-ValletHJ #evaluation #recommendation #using
- Use of Implicit Graph for Recommending Relevant Videos: A Simulated Evaluation (DV, FH, JMJ), pp. 199–210.
- ECIR-2008-WeiLLH #clustering #multi #query #summary
- A Cluster-Sensitive Graph Model for Query-Oriented Multi-document Summarization (FW, WL, QL, YH), pp. 446–453.
- ICML-2008-Bach #kernel
- Graph kernels between point clouds (FRB), pp. 25–32.
- ICML-2008-KondorB
- The skew spectrum of graphs (RK, KMB), pp. 496–503.
- ICML-2008-SarkarMP #incremental #performance #proximity #scalability
- Fast incremental proximity search in large graphs (PS, AWM, AP), pp. 896–903.
- ICML-2008-WangJC
- Graph transduction via alternating minimization (JW, TJ, SFC), pp. 1144–1151.
- ICPR-2008-EmmsHW #quantum #using
- Graph drawing using quantum commute time (DE, ERH, RCW), pp. 1–4.
- ICPR-2008-FerrerVSRB #algorithm #approximate #using
- An approximate algorithm for median graph computation using graph embedding (MF, EV, FS, KR, HB), pp. 1–4.
- ICPR-2008-FundanaHGS #segmentation
- Continuous graph cuts for prior-based object segmentation (KF, AH, CG, CS), pp. 1–4.
- ICPR-2008-GhoniemCE #video
- Video denoising via discrete regularization on graphs (MG, YC, AE), pp. 1–4.
- ICPR-2008-GongC #learning #online #optimisation #realtime #segmentation #using
- Real-time foreground segmentation on GPUs using local online learning and global graph cut optimization (MG, LC), pp. 1–4.
- ICPR-2008-Gonzalez-AguirreABD #geometry #modelling #self #using #visual notation
- Model-based visual self-localization using geometry and graphs (DIGA, TA, EBC, RD), pp. 1–5.
- ICPR-2008-GuimaraesPP #approach #detection #difference #distance #using #video
- An approach for video cut detection using bipartite graph matching as dissimilarity distance (SJFG, ZKGdPJ, HBdP), pp. 1–4.
- ICPR-2008-KokiopoulouPF #classification #multi
- Graph-based classification for multiple observations of transformed patterns (EK, SP, PF), pp. 1–4.
- ICPR-2008-LebrunPG #image #kernel #retrieval
- Image retrieval with graph kernel on regions (JL, SPF, PHG), pp. 1–4.
- ICPR-2008-LeKM #clustering
- Coring method for clustering a graph (TVL, CAK, IBM), pp. 1–4.
- ICPR-2008-LezorayTE #clustering
- Impulse noise removal by spectral clustering and regularization on graphs (OL, VTT, AE), pp. 1–4.
- ICPR-2008-LezorayTE08a #image
- Nonlocal graph regularization for image colorization (OL, VTT, AE), pp. 1–4.
- ICPR-2008-LiuLLJT #probability #representation
- Layered shape matching and registration: Stochastic sampling with hierarchical graph representation (XL, LL, HL, HJ, WT), pp. 1–4.
- ICPR-2008-RothausJ #clustering #distance #novel
- Constrained clustering by a novel graph-based distance transformation (KR, XJ), pp. 1–4.
- ICPR-2008-SanromaSA #clique #using
- Improving the matching of graphs generated from shapes by the use of procrustes distances into a clique-based MAP formulation (GS, FS, RA), pp. 1–4.
- ICPR-2008-ShiS #recognition
- A symbol graph based handwritten math expression recognition (YS, FKS), pp. 1–4.
- ICPR-2008-SugaFTA #recognition #segmentation #using
- Object recognition and segmentation using SIFT and Graph Cuts (AS, KF, TT, YA), pp. 1–4.
- ICPR-2008-TaEL #difference #equation
- Nonlocal morphological levelings by partial difference equations over weighted graphs (VTT, AE, OL), pp. 1–4.
- ICPR-2008-TangG #constraints #segmentation #video
- Video object segmentation based on graph cut with dynamic shape prior constraint (PT, LG), pp. 1–4.
- ICPR-2008-TorselloD #generative #learning
- Supervised learning of a generative model for edge-weighted graphs (AT, DLD), pp. 1–4.
- ICPR-2008-WhiteW #generative #modelling
- Parts based generative models for graphs (DHW, RCW), pp. 1–4.
- ICPR-2008-XiaoWH #invariant #recognition #using
- Object recognition using graph spectral invariants (XB, RCW, ERH), pp. 1–4.
- ICPR-2008-ZitouniSOD #algorithm #image #ranking #using #web
- Re-ranking of web image search results using a graph algorithm (HZ, SGS, DO, PD), pp. 1–4.
- KDD-2008-BecchettiBCG #algorithm #performance
- Efficient semi-streaming algorithms for local triangle counting in massive graphs (LB, PB, CC, AG), pp. 16–24.
- KDD-2008-HwangKRZ #mining
- Bridging centrality: graph mining from element level to group level (WH, TK, MR, AZ), pp. 336–344.
- KDD-2008-McGlohonAF #component #generative
- Weighted graphs and disconnected components: patterns and a generator (MM, LA, CF), pp. 524–532.
- KDD-2008-SaigoKT #mining
- Partial least squares regression for graph mining (HS, NK, KT), pp. 578–586.
- KDD-2008-SatoYN #information management #parametricity #semantics #using #word
- Knowledge discovery of semantic relationships between words using nonparametric bayesian graph model (IS, MY, HN), pp. 587–595.
- KDD-2008-SeshadriMSBFL #mobile
- Mobile call graphs: beyond power-law and lognormal distributions (MS, SM, AS, JB, CF, JL), pp. 596–604.
- KDD-2008-TongPSYF #mining #named #performance #scalability
- Colibri: fast mining of large static and dynamic graphs (HT, SP, JS, PSY, CF), pp. 686–694.
- KDD-2008-YangAPM #interactive #tool support
- A visual-analytic toolkit for dynamic interaction graphs (XY, SA, SP, SM), pp. 1016–1024.
- KR-2008-MotikGHS #representation #using
- Representing Structured Objects using Description Graphs (BM, BCG, IH, US), pp. 296–306.
- KR-2008-Rintanen
- Planning Graphs and Propositional Clause-Learning (JR), pp. 535–543.
- RecSys-2008-HadzicO #navigation
- Critique graphs for catalogue navigation (TH, BO), pp. 115–122.
- SEKE-2008-KraftW #eclipse
- Evaluating the Accuracy of Call Graphs Extracted with the Eclipse CDT (NAK, KSW), pp. 85–90.
- SIGIR-2008-BenderskyK #ranking #using
- Re-ranking search results using document-passage graphs (MB, OK), pp. 853–854.
- SIGIR-2008-LiWA #learning #query
- Learning query intent from regularized click graphs (XL, YYW, AA), pp. 339–346.
- SIGIR-2008-MeiZZ #framework #modelling #optimisation
- A general optimization framework for smoothing language models on graph structures (QM, DZ, CZ), pp. 611–618.
- PLDI-2008-HackG
- Copy coalescing by graph recoloring (SH, GG), pp. 227–237.
- ICSE-2008-ZimmermannN #analysis #dependence #fault #network #predict #using
- Predicting defects using network analysis on dependency graphs (TZ, NN), pp. 531–540.
- SAC-2008-AbedMS #analysis #multi #proving #reachability #theorem proving #using
- Reachability analysis using multiway decision graphs in the HOL theorem prover (SA, OAM, GAS), pp. 333–338.
- SAC-2008-BaF #composition #dependence #web #web service
- Dependence graphs for verifications of web service compositions with PEWS (CB, MHF), pp. 2387–2391.
- SAC-2008-BussBSE #analysis #flexibility #pointer #using
- Flexible pointer analysis using assign-fetch graphs (MB, DB, VCS, SAE), pp. 234–239.
- SAC-2008-NaderiRP #collaboration #information retrieval #similarity
- A graph-based profile similarity calculation method for collaborative information retrieval (HN, BR, JMP), pp. 1127–1131.
- SAC-2008-RamanathanKGJ #framework #named #testing
- PHALANX: a graph-theoretic framework for test case prioritization (MKR, MK, AG, SJ), pp. 667–673.
- SAC-2008-ZhouTBAG #ambiguity #named #query
- Gcon: a graph-based technique for resolving ambiguity in query translation candidates (DZ, MT, TJB, HA, JG), pp. 1566–1573.
- CASE-2008-AddadA #algebra #architecture #evaluation #modelling #using
- Modeling and response time evaluation of ethernet-based control architectures using timed event graphs and Max-Plus algebra (BA, SA), pp. 418–423.
- CASE-2008-Balasundaram #mining
- Cohesive subgroup model for graph-based text mining (BB), pp. 989–994.
- CC-2008-MarronHKS #analysis #modelling #performance
- Efficient Context-Sensitive Shape Analysis with Graph Based Heap Models (MM, MVH, DK, DS), pp. 245–259.
- CC-2008-WurthingerWM #dependence #visualisation
- Visualization of Program Dependence Graphs (TW, CW, HM), pp. 193–196.
- CGO-2008-KoesG
- Near-optimal instruction selection on dags (DRK, SCG), pp. 45–54.
- DAC-2008-HsuPB #data flow #parallel #simulation #thread
- Multithreaded simulation for synchronous dataflow graphs (CJH, JLP, SSB), pp. 331–336.
- DATE-2008-GhamarianGBS #analysis #data flow #parametricity #throughput
- Parametric Throughput Analysis of Synchronous Data Flow Graphs (AHG, MG, TB, SS), pp. 116–121.
- DATE-2008-HosseinabadyKMP #architecture #energy #latency #performance #scalability
- De Bruijn Graph as a Low Latency Scalable Architecture for Energy Efficient Massive NoCs (MH, MRK, JM, DKP), pp. 1370–1373.
- DATE-2008-MokhovY #configuration management #partial order #synthesis
- Conditional Partial Order Graphs and Dynamically Reconfigurable Control Synthesis (AM, AY), pp. 1142–1147.
- HPCA-2008-ChenMP #constraints #memory management #runtime #using #validation
- Runtime validation of memory ordering using constraint graph checking (KC, SM, PP), pp. 415–426.
- LCTES-2008-AuerbachBGSV #concurrent #flexibility #java #programming #strict #thread
- Flexible task graphs: a unified restricted thread programming model for java (JSA, DFB, RG, JHS, JV), pp. 1–11.
- PDP-2008-LinC #algorithm #clustering #internet #named #parallel #simulation
- BC-GA: A Graph Partitioning Algorithm for Parallel Simulation of Internet Applications (SL, XC), pp. 358–365.
- FASE-2008-OrejasEP #constraints #logic
- A Logic of Graph Constraints (FO, HE, UP), pp. 179–198.
- STOC-2008-AroraKKSTV #constraints #game studies
- Unique games on expanding constraint graphs are easy: extended abstract (SA, SK, AK, DS, MT, NKV), pp. 21–28.
- STOC-2008-BartoKN #complexity #morphism #problem
- Graphs, polymorphisms and the complexity of homomorphism problems (LB, MK, TN), pp. 789–796.
- STOC-2008-Ben-AroyaT #combinator #using
- A combinatorial construction of almost-ramanujan graphs using the zig-zag product (ABA, ATS), pp. 325–334.
- STOC-2008-BenjaminiSS
- Every minor-closed property of sparse graphs is testable (IB, OS, AS), pp. 393–402.
- STOC-2008-ChoiK #bound #complexity #query
- Optimal query complexity bounds for finding graphs (SSC, JHK), pp. 749–758.
- STOC-2008-FriezeVV #random
- Logconcave random graphs (AMF, SV, JV), pp. 779–788.
- STOC-2008-KawarabayashiM #linear #morphism
- Graph and map isomorphism and all polyhedral embeddings in linear time (KiK, BM), pp. 471–480.
- STOC-2008-OrecchiaSVV #clustering #on the
- On partitioning graphs via single commodity flows (LO, LJS, UVV, NKV), pp. 461–470.
- STOC-2008-SpielmanS #effectiveness
- Graph sparsification by effective resistances (DAS, NS), pp. 563–568.
- ISSTA-2008-BaahPH #dependence #fault #probability
- The probabilistic program dependence graph and its application to fault diagnosis (GKB, AP, MJH), pp. 189–200.
- ECDL-2007-WanX #approach #multi #towards
- Towards a Unified Approach Based on Affinity Graph to Various Multi-document Summarizations (XW, JX), pp. 297–308.
- SIGMOD-2007-ChengKNL #database #named #query #towards
- Fg-index: towards verification-free query processing on graph databases (JC, YK, WN, AL), pp. 857–872.
- SIGMOD-2007-FaloutsosKS #matrix #mining #scalability #tool support #using
- Mining large graphs and streams using matrix and tensor tools (CF, TGK, JS), p. 1174.
- SIGMOD-2007-HeWYY #keyword #named
- BLINKS: ranked keyword searches on graphs (HH, HW, JY, PSY), pp. 305–316.
- SIGMOD-2007-TrisslL #performance #query #scalability
- Fast and practical indexing and querying of very large graphs (ST, UL), pp. 845–856.
- VLDB-2007-ChenYYHZG #towards
- Towards Graph Containment Search and Indexing (CC, XY, PSY, JH, DQZ, XG), pp. 926–937.
- VLDB-2007-QiCS #query
- Sum-Max Monotonic Ranked Joins for Evaluating Top-K Twig Queries on Weighted Data Graphs (YQ, KSC, MLS), pp. 507–518.
- VLDB-2007-ZhaoYY
- Graph Indexing: Tree + Delta >= Graph (PZ, JXY, PSY), pp. 938–949.
- ITiCSE-2007-Sanchez-TorrubiaTC #algorithm #interactive #learning #tool support
- New interactive tools for graph algorithms active learning (MGST, CTB, JC), p. 337.
- CSMR-2007-Quante #online #process
- Online Construction of Dynamic Object Process Graphs (JQ), pp. 113–122.
- CSMR-2007-Quante07a #comprehension #process #protocol
- Dynamic Object Process Graph Extraction for Program Understanding and Protocol Recovery (JQ), pp. 345–348.
- ICSM-2007-BernardiL #aspect-oriented #control flow #interprocedural #maintenance
- An Interprocedural Aspect Control Flow Graph to Support the Maintenance of Aspect Oriented Systems (MLB, GADL), pp. 435–444.
PASTE-2007-Lhotak - Comparing call graphs (OL), pp. 37–42.
- SCAM-2007-LochbihlerS #dependence #on the
- On Temporal Path Conditions in Dependence Graphs (AL, GS), pp. 49–58.
- DLT-2007-BrijderH #assembly #reduction
- Characterizing Reduction Graphs for Gene Assembly in Ciliates (RB, HJH), pp. 120–131.
- DLT-2007-Priese #automaton #finite
- Finite Automata on Unranked and Unordered DAGs (LP), pp. 346–360.
- ICALP-2007-AlonCHKRS #algorithm
- Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions (NA, ACO, HH, MK, VR, MS), pp. 789–800.
- ICALP-2007-BergerG
- Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs (AB, MG), pp. 90–101.
- ICALP-2007-Coja-OghlanPS #on the #random
- On the Chromatic Number of Random Graphs (ACO, KP, AS), pp. 777–788.
- ICALP-2007-FellowsFHV
- Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs (MRF, GF, DH, SV), pp. 340–351.
- ICALP-2007-FraigniaudGIP #distributed
- Distributed Computing with Advice: Information Sensitivity of Graph Coloring (PF, CG, DI, AP), pp. 231–242.
- ICALP-2007-GuoN #kernel #linear #np-hard #problem
- Linear Problem Kernels for NP-Hard Problems on Planar Graphs (JG, RN), pp. 375–386.
- LATA-2007-Diekert #equation #named #word
- Equations: From Words to Graph Products (VD), pp. 1–6.
- LATA-2007-LohreyS #problem #set
- The submonoid and rational subset membership problems for graph groups (ML, BS), pp. 367–378.
- ICFP-2007-Sereni #analysis #functional #higher-order #source code #termination
- Termination analysis and call graph construction for higher-order functional programs (DS), pp. 71–84.
IFL-2007-MazanekM #combinator #parsing- Graph Parser Combinators (SM, MM), pp. 1–18.
- IFL-2007-NaylorR #reduction #using
- The Reduceron: Widening the von Neumann Bottleneck for Graph Reduction Using an FPGA (MN, CR), pp. 129–146.
- CIG-2007-Ashlock
- Cooperation in Prisoner's Dilemma on Graphs (DAA), pp. 48–55.
- AGTIVE-2007-AschenbrennerG #graph grammar #using
- Transforming Scene Graphs Using Triple Graph Grammars — A Practice Report (NA, LG), pp. 32–43.
- AGTIVE-2007-BatzKG #evaluation #pattern matching
- A First Experimental Evaluation of Search Plan Driven Graph Pattern Matching (GVB, MK, RG), pp. 471–486.
- AGTIVE-2007-MatznerMS #automation #performance
- Efficient Graph Matching with Application to Cognitive Automation (AM, MM, AS), pp. 297–312.
- AGTIVE-2007-RangerGH #interface
- Defining Abstract Graph Views as Module Interfaces (UR, KG, MH), pp. 120–135.
- AGTIVE-2007-VarroHV #pattern matching #recursion
- Recursive Graph Pattern Matching (GV, ÁH, DV), pp. 456–470.
- GT-VMT-2007-HorvathVV
- Generic Search Plans for Matching Advanced Graph Patterns (ÁH, GV, DV).
- GT-VMT-2007-KohlerLT #constraints #model transformation
- Ensuring Containment Constraints in Graph-based Model Transformation Approaches (CK, HL, GT).
- GT-VMT-2007-SheehanGQ
- Imposing Hierarchy on a Graph (BS, BG, AJQ).
- GT-VMT-2007-WorzbergerHH #tool support #workflow
- Evaluating Workflow Definition Language Revisions with Graph-Based Tools (RW, MH, FWH).
- GT-VMT-2007-WrobelEP #framework #product line
- Graph-Based Engineering Systems — A Family of Software Applications and their Underlying Framework (GW, REE, MP).
- HCI-IPT-2007-Misue #visualisation
- Anchored Maps: Visualization Techniques for Drawing Bipartite Graphs (KM), pp. 106–114.
- VISSOFT-2007-BohnetD #2d #source code #visualisation
- Facilitating Exploration of Unfamiliar Source Code by Providing 21/2D Visualizations of Dynamic Call Graphs (JB, JD), pp. 63–66.
- VISSOFT-2007-BohnetD07a #compilation #comprehension
- CGA Call Graph Analyzer — Locating and Understanding Functionality within the Gnu Compiler Collection’s Million Lines of Code (JB, JD), pp. 161–162.
- VISSOFT-2007-KagdiM #diagrams #uml
- Onion Graphs for Focus+Context Views of UML Class Diagrams (HHK, JIM), pp. 80–87.
- CAiSE-2007-EderW #comparison #detection #ontology #using
- Change Detection in Ontologies Using DAG Comparison (JE, KW), pp. 21–35.
- ICEIS-AIDSS-2007-FurstT #concept #ontology
- Heavyweight Ontology Matching — A Method and a Tool based on the Conceptual Graphs Model (FF, FT), pp. 265–270.
- ICEIS-DISI-2007-TraversD #optimisation #perspective #xquery
- An extensible rule transformation model for XQuery optimization — rules pattern for XQuery tree graph view (NT, TTDN), pp. 351–358.
- ICEIS-HCI-2007-BabaianLT #approach #process #visualisation
- Visualizing the Process — A Graph-Based Approach to Enhancing System-User Knowledge Sharing (TB, WTL, HT), pp. 123–128.
- CIKM-2007-BrinkmeierWR #community
- Communities in graphs and hypergraphs (MB, JW, SR), pp. 869–872.
- CIKM-2007-LangA
- Finding dense and isolated submarkets in a sponsored search spending graph (KJL, RA), pp. 613–622.
- CIKM-2007-Martinez-BazanMGNSL #information retrieval #named #scalability
- Dex: high-performance exploration on large graphs for information retrieval (NMB, VMM, SGV, JN, MASM, JLLP), pp. 573–582.
- CIKM-2007-YangQZGL #analysis #using #web
- Link analysis using time series of web graphs (LY, LQ, YPZ, BG, TYL), pp. 1011–1014.
- ICML-2007-AgarwalC #learning #random #rank
- Learning random walks to rank nodes in graphs (AA, SC), pp. 9–16.
- ICML-2007-JohnsM #approximate
- Constructing basis functions from directed graphs for value function approximation (JJ, SM), pp. 385–392.
- ICML-2007-LeskovecF #modelling #multi #scalability #using
- Scalable modeling of real graphs using Kronecker multiplication (JL, CF), pp. 497–504.
- ICML-2007-RattiganMJ #clustering #network
- Graph clustering with network structure indices (MJR, MEM, DJ), pp. 783–790.
- ICML-2007-Tsuda
- Entire regularization paths for graph data (KT), pp. 919–926.
- KDD-2007-AsurPU #behaviour #framework #interactive
- An event-based framework for characterizing the evolutionary behavior of interaction graphs (SA, SP, DU), pp. 913–921.
- KDD-2007-JoLG #correlation #detection #research #topic
- Detecting research topics via the correlation between graphs and texts (YJ, CL, CLG), pp. 370–379.
- KDD-2007-KeCN #correlation #database
- Correlation search in graph databases (YK, JC, WN), pp. 390–399.
- KDD-2007-SunFPY #mining #named #scalability
- GraphScope: parameter-free mining of large time-evolving graphs (JS, CF, SP, PSY), pp. 687–696.
- KDD-2007-TongFGE #pattern matching #performance #scalability
- Fast best-effort pattern matching in large attributed graphs (HT, CF, BG, TER), pp. 737–746.
- KDD-2007-TongFK #mining #performance #proximity
- Fast direction-aware proximity for graph mining (HT, CF, YK), pp. 747–756.
- MLDM-2007-RiesenKB
- Reducing the Dimensionality of Vector Space Embeddings of Graphs (KR, VK, HB), pp. 563–573.
- MLDM-2007-WuW #kernel #parametricity
- Choosing the Kernel Parameters for the Directed Acyclic Graph Support Vector Machines (KPW, SDW), pp. 276–285.
- MLDM-2007-YuL #approach #classification #named
- PE-PUC: A Graph Based PU-Learning Approach for Text Classification (SY, CL), pp. 574–584.
- SIGIR-2007-Broschart #integration #performance #proximity #retrieval
- Efficient integration of proximity for text, semi-structured and graph retrieval (AB), p. 917.
- SIGIR-2007-CraswellS #random
- Random walks on the click graph (NC, MS), pp. 239–246.
- LOPSTR-2007-NguyenGSS #analysis #dependence #logic programming #source code #termination
- Termination Analysis of Logic Programs Based on Dependency Graphs (MTN, JG, PSK, DDS), pp. 8–22.
- PEPM-2007-MollerS #program analysis #xml
- XML graphs in program analysis (AM, MIS), pp. 1–10.
QAPL-2007-BistarelliMRS #constraints #logic programming #modelling #multi #using- Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming (SB, UM, FR, FS), pp. 111–127.
- SAC-2007-FrancisS #constraints
- Constraint propagation for loose constraint graphs (KF, PJS), pp. 334–335.
- SAC-2007-GooneratneTH #algorithm #traversal #using #verification #web #web service
- Verification of web service descriptions using graph-based traversal algorithms (NG, ZT, JH), pp. 1385–1392.
- SAC-2007-JinC
- Hierarchical alignment graph for gene teams finding on whole genomes (HJJ, HGC), pp. 113–117.
- SAC-2007-JinS #information management #representation
- Graph-based text representation and knowledge discovery (WJ, RKS), pp. 807–811.
- SAC-2007-YuSZX #named #semantics #web #web service
- SNet: skip graph based semantic web services discovery (JY, HS, GZ, KX), pp. 1393–1397.
- CC-2007-LeeRBM #constraints #control flow #using
- Correcting the Dynamic Call Graph Using Control-Flow Constraints (BL, KR, MDB, KSM), pp. 80–95.
- CGO-2007-CodinaSG #clustering #scheduling
- Virtual Cluster Scheduling Through the Scheduling Graph (JMC, FJS, AG), pp. 89–101.
- CGO-2007-DrewekeWFSMP #abstraction
- Graph-Based Procedural Abstraction (AD, MW, IF, DS, TM, MP), pp. 259–270.
- DAC-2007-Levitan #random
- You Can Get There From Here: Connectivity of Random Graphs on Grids (SPL), pp. 272–273.
- DAC-2007-StuijkBGC #data flow #multi #resource management
- Multiprocessor Resource Allocation for Throughput-Constrained Synchronous Dataflow Graphs (SS, TB, MG, HC), pp. 777–782.
- DAC-2007-WiggersBS #data flow #performance
- Efficient Computation of Buffer Capacities for Cyclo-Static Dataflow Graphs (MW, MB, GJMS), pp. 658–663.
- DATE-2007-SatishRK #approach #communication #constraints #multi #optimisation #scheduling
- A decomposition-based constraint optimization approach for statically scheduling task graphs with communication delays to multiprocessors (NS, KR, KK), pp. 57–62.
- DATE-2007-SchlieckerSE #analysis #composition #data flow #integration #performance
- Performance analysis of complex systems by integration of dataflow graphs and compositional performance analysis (SS, SS, RE), pp. 273–278.
- DATE-2007-ZhuP #algorithm #probability #random
- Random sampling of moment graph: a stochastic Krylov-reduction algorithm (ZZ, JRP), pp. 1502–1507.
- LCTES-2007-0002NX
- Scratchpad allocation for data aggregates in superperfect graphs (LL, QHN, JX), pp. 207–216.
- STOC-2007-AnshelevichK #3d #polynomial
- Terminal backup, 3D matching, and covering cubic graphs (EA, AK), pp. 391–400.
- STOC-2007-BrinkmanKL #random #reduction
- Vertex cuts, random walks, and dimension reduction in series-parallel graphs (BB, AK, JRL), pp. 621–630.
- STOC-2007-Chan #algorithm
- More algorithms for all-pairs shortest paths in weighted graphs (TMC), pp. 590–598.
- STOC-2007-ChuzhoyGKT
- Hardness of routing with congestion in directed graphs (JC, VG, SK, KT), pp. 165–178.
- STOC-2007-HariharanKPB #algorithm
- An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs (RH, TK, DP, AB), pp. 605–614.
- STOC-2007-HayesVV
- Randomly coloring planar graphs with fewer colors than the maximum degree (TPH, JCV, EV), pp. 450–458.
- STOC-2007-MooreRS #algorithm #morphism #on the #quantum
- On the impossibility of a quantum sieve algorithm for graph isomorphism (CM, AR, PS), pp. 536–545.
- STOC-2007-VassilevskaWY
- All-pairs bottleneck paths for general graphs in truly sub-cubic time (VV, RW, RY), pp. 585–589.
- TACAS-2007-ManevichBCRS #analysis #composition
- Shape Analysis by Graph Decomposition (RM, JB, BC, GR, MS), pp. 3–18.
- DRR-2006-LoprestiNJ #correlation #generative
- Match graph generation for symbolic indirect correlation (DPL, GN, AJ).
- ECDL-2006-SfakakisK #protocol #semantics
- A Semantics-Based Graph for the Bib-1 Access Points of the Z39.50 Protocol (MS, SK), pp. 445–448.
- JCDL-2006-McRae-SpencerS #ambiguity #approach
- Also by the same author: AKTiveAuthor, a citation graph approach to name disambiguation (DMMS, NRS), pp. 53–54.
- PODS-2006-MotwaniX #evolution #modelling #random #web
- Evolution of page popularity under random web graph models (RM, YX), pp. 134–142.
- SIGMOD-2006-BorgwardtBK #mining #named #visual notation
- VGM: visual graph mining (KMB, SB, HPK), pp. 733–735.
- SIGMOD-2006-SpiegelP #estimation #relational
- Graph-based synopses for relational selectivity estimation (JS, NP), pp. 205–216.
- VLDB-2006-RodriguesTTFL #interactive #mining #named #scalability #visualisation
- GMine: A System for Scalable, Interactive Graph Visualization and Mining (JFRJ, HT, AJMT, CF, JL), pp. 1195–1198.
- ITiCSE-2006-Snapp06a #algorithm #education
- Teaching graph algorithms in a corn maze (RRS), p. 347.
- CSMR-2006-QuanteK #process
- Dynamic Object Process Graphs (JQ, RK), pp. 81–90.
- ICSM-2006-ByersASD #modelling
- Modeling Software Vulnerabilities With Vulnerability Cause Graphs (DB, SA, NS, CD), pp. 411–422.
- ICSM-2006-NeginhalK #c #comprehension #reduction
- Event Views and Graph Reductions for Understanding System Level C Code (SN, SK), pp. 279–288.
- SCAM-2006-SawinR #algorithm #runtime
- Estimating the Run-Time Progress of a Call Graph Construction Algorithm (JS, AR), pp. 53–62.
- SCAM-2006-ZhangR #java #library
- Constructing Accurate Application Call Graphs For Java To Model Library Callbacks (WZ, BGR), pp. 63–74.
- WCRE-2006-CleveHH #dependence #reverse engineering #using
- Data Reverse Engineering using System Dependency Graphs (AC, JH, JLH), pp. 157–166.
- WCRE-2006-Krinke #control flow #mining
- Mining Control Flow Graphs for Crosscutting Concerns (JK), pp. 334–342.
- DLT-2006-MenzelPS
- Some Examples of Semi-rational DAG Languages (JRM, LP, MS), pp. 351–362.
- ICALP-v1-2006-CarrollGM #bound
- Embedding Bounded Bandwidth Graphs into l1 (DEC, AG, AM), pp. 27–37.
- ICALP-v1-2006-Coja-Oghlan #adaptation #clustering #heuristic #random
- An Adaptive Spectral Heuristic for Partitioning Random Graphs (ACO), pp. 691–702.
- ICALP-v1-2006-Coja-OghlanL #random
- The Spectral Gap of Random Graphs with Given Expected Degrees (ACO, AL), pp. 15–26.
- ICALP-v1-2006-DjidjevV
- Planar Crossing Numbers of Genus g Graphs (HD, IV), pp. 419–430.
- ICALP-v1-2006-DyerGP #morphism #on the
- On Counting Homomorphisms to Directed Acyclic Graphs (MED, LAG, MP), pp. 38–49.
- ICALP-v1-2006-GroheV #game studies #morphism #parallel #testing
- Testing Graph Isomorphism in Parallel by Playing a Game (MG, OV), pp. 3–14.
- ICALP-v1-2006-HariharanKM #algorithm #performance
- A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs (RH, TK, KM), pp. 250–261.
- ICALP-v1-2006-HeZ
- Nearly Optimal Visibility Representations of Plane Graphs (XH, HZ), pp. 407–418.
- ICALP-v1-2006-KormanP
- Dynamic Routing Schemes for General Graphs (AK, DP), pp. 619–630.
- ICALP-v1-2006-RaoZ
- Edge Disjoint Paths in Moderately Connected Graphs (SR, SZ), pp. 202–213.
- ICALP-v1-2006-VassilevskaWY #problem
- Finding the Smallest H-Subgraph in Real Weighted Graphs and Related Problems (VV, RW, RY), pp. 262–273.
- SEFM-2006-DSouzaG
- Computing Complete Test Graphs for Hierarchical Systems (DD, MG), pp. 70–79.
- CIG-2006-TeramotoDU #complexity #game studies
- Voronoi game on graphs and its complexity (ST, EDD, RU), pp. 265–271.
- ICGT-2006-BaldanCFG #process #transaction
- Graph Transactions as Processes (PB, AC, LF, FG), pp. 199–214.
- ICGT-2006-BerwangerJ #automaton
- Automata on Directed Graphs: Edge Versus Vertex Marking (DB, DJ), pp. 46–60.
- ICGT-2006-EdelkampJL #analysis #heuristic
- Heuristic Search for the Analysis of Graph Transition Systems (SE, SJ, ALL), pp. 414–429.
- ICGT-2006-RotschkeS #evolution #query
- Temporal Graph Queries to Support Software Evolution (TR, AS), pp. 291–305.
- CHI-2006-Adar #interface #named
- GUESS: a language and interface for graph exploration (EA), pp. 791–800.
- CHI-2006-WallB #feedback #navigation #what
- Feeling what you hear: tactile feedback for navigation of audio graphs (SAW, SAB), pp. 1123–1132.
- CHI-2006-Wattenberg #multi #visual notation
- Visual exploration of multivariate graphs (MW), pp. 811–819.
- CSCW-2006-JacoviSGUSM #analysis
- The chasms of CSCW: a citation graph analysis of the CSCW conference (MJ, VS, GGF, SU, ES, NM), pp. 289–298.
- SOFTVIS-2006-BohnetD #feature model #visual notation
- Visual exploration of function call graphs for feature location in complex software systems (JB, JD), pp. 95–104.
- SOFTVIS-2006-Jucknath-JohnG #evolution #modelling #scalability #visualisation
- Icon graphs: visualizing the evolution of large class models (SJJ, DG), pp. 167–168.
- SOFTVIS-2006-Pietriga #semantics #visualisation #web
- Semantic web data visualization with graph style sheets (EP), pp. 177–178.
- CIKM-2006-BerberichBW #performance #rank #web
- Rank synopses for efficient time travel on the web graph (KB, SJB, GW), pp. 864–865.
- CIKM-2006-NanavatiGDCDMJ #on the
- On the structural properties of massive telecom call graphs: findings and implications (AAN, SG, GD, DC, KD, SM, AJ), pp. 435–444.
- CIKM-2006-TheodoratosSDPS #heuristic #query
- Heuristic containment check of partial tree-pattern queries in the presence of index graphs (DT, SS, TD, PP, TKS), pp. 445–454.
- ICML-2006-Agarwal #ranking
- Ranking on graph data (SA0), pp. 25–32.
- ICML-2006-AgarwalBB #higher-order #learning
- Higher order learning with graphs (SA, KB, SB), pp. 17–24.
- ICML-2006-BezakovaKS #using
- Graph model selection using maximum likelihood (IB, AK, RS), pp. 105–112.
- ICML-2006-Hanneke #analysis #learning
- An analysis of graph cut size for transductive learning (SH), pp. 393–399.
- ICML-2006-TsudaK #clustering #mining
- Clustering graphs by weighted substructure mining (KT, TK), pp. 953–960.
- ICPR-v1-2006-ChenCLT #algorithm #automation #image #segmentation #using
- Automatic Segmentation of Lung Fields from Radiographic Images of SARS Patients Using a New Graph Cuts Algorithm (SC, LC, JL, XT), pp. 271–274.
- ICPR-v1-2006-ChiaHL #multi #representation
- Multiple Objects Tracking with Multiple Hypotheses Graph Representation (AYSC, WH, LL), pp. 638–641.
- ICPR-v1-2006-WuW #using
- Stereo Correspondence Using Stripe Adjacency Graph (CCW, ZFW), pp. 123–126.
- ICPR-v2-2006-AhnKB #estimation #robust #segmentation #using
- Robust Object Segmentation Using Graph Cut with Object and Background Seed Estimation (JHA, KCK, HB), pp. 361–364.
- ICPR-v2-2006-ChenS #verification
- A New Off-line Signature Verification Method based on Graph (SC, SNS), pp. 869–872.
- ICPR-v2-2006-HaxhimusaIK #segmentation
- Evaluating Hierarchical Graph-based Segmentation (YH, AI, WGK), pp. 195–198.
- ICPR-v2-2006-KimK06b #estimation #modelling #monte carlo #multi #online
- Multi-modal Sequential Monte Carlo for On-Line Hierarchical Graph Structure Estimation in Model-based Scene Interpretation (SK, ISK), pp. 251–254.
- ICPR-v2-2006-KirkegaardM
- Bin-Picking based on Harmonic Shape Contexts and Graph-Based Matching (JK, TBM), pp. 581–584.
- ICPR-v2-2006-VanhamelSP #image #multi #segmentation
- Nonlinear Multiscale Graph Theory based Segmentation of Color Images (IV, HS, IP), pp. 407–411.
- ICPR-v3-2006-BarbuRLAHT #algorithm #classification #recognition #search-based #using
- Graph Classification Using Genetic Algorithm and Graph Probing Application to Symbol Recognition (EB, RR, HL, SA, PH, ÉT), pp. 296–299.
- ICPR-v3-2006-DePieroC
- Structural Matching Via Optimal Basis Graphs (FWD, JKC), pp. 449–452.
- ICPR-v3-2006-EmmsHW #quantum #using
- Graph Matching using Interference of Coined Quantum Walks (DE, ERH, RCW), pp. 133–136.
- ICPR-v3-2006-PozdnoukhovB #invariant #kernel #pattern matching #pattern recognition #recognition
- Graph-based transformation manifolds for invariant pattern recognition with kernel methods (AP, SB), pp. 1228–1231.
- ICPR-v3-2006-QiuH #using
- Graph Matching using Commute Time Spanning Trees (HQ, ERH), pp. 1224–1227.
- ICPR-v3-2006-XuL06a #recognition #sketching
- Face Recognition by Expression-Driven Sketch Graph Matching (ZX, JL), pp. 1119–1122.
- ICPR-v3-2006-ZhaoY #incremental #reduction
- Incremental Construction of Neighborhood Graphs for Nonlinear Dimensionality Reduction (DZ, LY), pp. 177–180.
- ICPR-v4-2006-FengL #clustering #self
- Self-Validated and Spatially Coherent Clustering with Net-Structured MRF and Graph Cuts (WF, ZQL), pp. 37–40.
- ICPR-v4-2006-NeuhausB #kernel
- A Convolution Edit Kernel for Error-tolerant Graph Matching (MN, HB), pp. 220–223.
- ICPR-v4-2006-PozdnoukhovB06a #invariant #kernel #pattern matching #pattern recognition #recognition
- Graph-based transformation manifolds for invariant pattern recognition with kernel methods (AP, SB), p. 956.
- ICPR-v4-2006-QiuH06a #using
- Graph Matching using Commute Time Spanning Tr (HQ, ERH), p. 955.
- ICPR-v4-2006-WhiteW
- Mixing spectral representations of graphs (DHW, RCW), pp. 140–144.
- ICPR-v4-2006-Yang #linear
- Building Connected Neighborhood Graphs for Locally Linear Embedding (LY), pp. 194–197.
- ICPR-v4-2006-YuH #kernel #string
- String Kernels for Matching Seriated Graphs (HY, ERH), pp. 224–228.
- KDD-2006-HorvathRW #mining
- Frequent subgraph mining in outerplanar graphs (TH, JR, SW), pp. 197–206.
- KDD-2006-LeskovecF #scalability
- Sampling from large graphs (JL, CF), pp. 631–636.
- KDD-2006-LiuCHY #analysis #dependence #detection #named
- GPLAG: detection of software plagiarism by program dependence graph analysis (CL, CC, JH, PSY), pp. 872–881.
- KDD-2006-LongWZY #learning
- Unsupervised learning on k-partite graphs (BL, XW, Z(Z, PSY), pp. 317–326.
- KDD-2006-SunTF #analysis
- Beyond streams and graphs: dynamic tensor analysis (JS, DT, CF), pp. 374–383.
- KDD-2006-YooHS #clustering #integration #refinement #representation #semantics
- Integration of semantic-based bipartite graph representation and mutual refinement strategy for biomedical literature clustering (IY, XH, IYS), pp. 791–796.
- KDD-2006-ZengWZK #clique #database #scalability
- Coherent closed quasi-clique discovery from large dense graph databases (ZZ, JW, LZ, GK), pp. 797–802.
- KDD-2006-ZhangPD #categorisation #linear #modelling #predict
- Linear prediction models with graph regularization for web-page categorization (TZ, AP, BD), pp. 821–826.
- KR-2006-CroitoruC #algorithm #composition #concept
- A Tree Decomposition Algorithm for Conceptual Graph Projection (MC, EC), pp. 271–276.
- KR-2006-WachterH #representation
- Propositional DAGs: A New Graph-Based Language for Representing Boolean Functions (MW, RH), pp. 277–285.
- SIGIR-2006-AngelovaW #classification
- Graph-based text classification: learn from your neighbors (RA, GW), pp. 485–492.
- SIGIR-2006-MinkovCN #ambiguity #email #using
- Contextual search and name disambiguation in email using graphs (EM, WWC, AYN), pp. 27–34.
- SIGIR-2006-WuJ #framework #learning #multi
- A graph-based framework for relation propagation and its application to multi-label learning (MW, RJ), pp. 717–718.
- LOPSTR-2006-ArroyoRSV #partial evaluation #using
- Improving Offline Narrowing-Driven Partial Evaluation Using Size-Change Graphs (GA, JGR, JS, GV), pp. 60–76.
- PADL-2006-LiuS #query
- Querying Complex Graphs (YAL, SDS), pp. 199–214.
- PEPM-2006-HammerGK #dependence
- Dynamic path conditions in dependence graphs (CH, MG, JK), pp. 58–67.
- PPDP-2006-BundgaardS #π-calculus
- Typed polyadic π-calculus in bigraphs (MB, VS), pp. 1–12.
- ICSE-2006-JorgesMS #generative #modelling #named
- FormulaBuilder: a tool for graph-based modelling and generation of formulae (SJ, TMS, BS), pp. 815–818.
- SAC-2006-AgostiFO #automation #image
- Graph-based automatic suggestion of relationships among images of illuminated manuscripts (MA, NF, NO), pp. 1063–1067.
- SAC-2006-HorvathHW #effectiveness #induction
- Effective rule induction from labeled graphs (TH, SH, SW), pp. 611–616.
- SAC-2006-PettovelloF #named #xml #xpath
- MTree: an XML XPath graph index (PMP, FF), pp. 474–481.
- SAC-2006-ZhangG #composition #constraints #geometry #theorem proving
- Spatial geometric constraint solving based on k-connected graph decomposition (GFZ, XSG), pp. 979–983.
- CASE-2006-AlenljungL #semantics
- Semantics of Sensor Activation Graphs (TA, BL), pp. 419–424.
- CASE-2006-LeeLS #clustering
- Token delays and generalized workload balancing for timed event graphs with application to cluster tool operation (TEL, HYL, RSS), pp. 93–99.
- CASE-2006-LiLWC #automation #component #equation #generative #linear #using
- Automatic Generation of Component-level Dynamic Equations Using Extensible Element Linear Graph Method (YL, ZL, HW, YC), pp. 118–123.
- CGO-2006-CooperD #compilation #runtime
- Tailoring Graph-coloring Register Allocation For Runtime Compilation (KDC, AD), pp. 39–49.
- DAC-2006-HsuRKPB #data flow #performance #simulation
- Efficient simulation of critical synchronous dataflow graphs (CJH, SR, MYK, JLP, SSB), pp. 893–898.
- DAC-2006-StuijkGB #constraints #data flow #requirements #throughput #trade-off
- Exploring trade-offs in buffer requirements and throughput constraints for synchronous dataflow graphs (SS, MG, TB), pp. 899–904.
- FASE-2006-TaentzerC #approach #documentation #xml
- A Graph-Based Approach to Transform XML Documents (GT, GTC), pp. 48–62.
- FoSSaCS-2006-Serre #game studies #process
- Parity Games Played on Transition Graphs of One-Counter Processes (OS), pp. 337–351.
- STOC-2006-BansalCES
- A quasi-PTAS for unsplittable flow on line graphs (NB, AC, AE, BS), pp. 721–729.
- STOC-2006-BarakRSW
- 2-source dispersers for sub-polynomial entropy and Ramsey graphs beating the Frankl-Wilson construction (BB, AR, RS, AW), pp. 671–680.
- STOC-2006-BorgsCLSSV #parametricity #testing
- Graph limits and parameter testing (CB, JTC, LL, VTS, BS, KV), pp. 261–270.
- STOC-2006-ChekuriKS #constant
- Edge-disjoint paths in Planar graphs with constant congestion (CC, SK, FBS), pp. 757–766.
- STOC-2006-ChuzhoyK #problem
- Hardness of cut problems in directed graphs (JC, SK), pp. 527–536.
- STOC-2006-HallgrenMRRS #morphism #quantum
- Limitations of quantum coset states for graph isomorphism (SH, CM, MR, AR, PS), pp. 604–617.
- STOC-2006-KawarabayashiM #approximate
- Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs (KiK, BM), pp. 401–416.
- STOC-2006-KhandekarRV #clustering #using
- Graph partitioning using single commodity flows (RK, SR, UVV), pp. 385–390.
- STOC-2006-Klein #set
- A subset spanner for Planar graphs, : with application to subset TSP (PNK), pp. 749–756.
- STOC-2006-ReingoldTV #problem #pseudo
- Pseudorandom walks on regular digraphs and the RL vs. L problem (OR, LT, SPV), pp. 457–466.
- STOC-2006-Shapira #all about #combinator
- A combinatorial characterization of the testable graph properties: it’s all about regularity (NA, EF, IN, AS), pp. 251–260.
- TACAS-2006-LeueW #approach #proving #termination
- A Region Graph Based Approach to Termination Proofs (SL, WW), pp. 318–333.
- TACAS-2006-SokolskyKL #similarity
- Simulation-Based Graph Similarity (OS, SK, IL), pp. 426–440.
- CAV-2006-ManoliosV #analysis #termination
- Termination Analysis with Calling Context Graphs (PM, DV), pp. 401–414.
- CSL-2006-Marcinkowski #logic #on the #power of
- On the Expressive Power of Graph Logic (JM), pp. 486–500.
- IJCAR-2006-NipkowBS
- Flyspeck I: Tame Graphs (TN, GB, PS), pp. 21–35.
- HT-2005-ToyodaK #evolution #visualisation #web
- A system for visualizing and analyzing the evolution of the web with a time series of graphs (MT, MK), pp. 151–160.
- ICDAR-2005-ArrivaultRB #approach #fuzzy
- A Fuzzy Hierarchical Attributed Graph Approach for Handwritten Egyptian Hieroglyphs description and matching (DA, NR, PB), pp. 898–903.
- ICDAR-2005-HaritJC #geometry #image #independence #representation #retrieval #word
- Improved Geometric Feature Graph: A Script Independent Representation of Word Images for Compression, and Retrieval (GH, RJ, SC), pp. 421–425.
- ICDAR-2005-SternbyF #adaptation #independence #online #recognition
- The Recognition Graph — Language Independent Adaptable On-line Cursive Script Recognition (JS, CF), pp. 14–18.
- ICDAR-2005-Suwa #representation #segmentation
- Segmentation of Connected Handwritten Numerals by Graph Representation (MS), pp. 750–754.
- SIGMOD-2005-LeeOH #database #named #scalability #video
- STRG-Index: Spatio-Temporal Region Graph Indexing for Large Video Databases (JL, JHO, SH), pp. 718–729.
- SIGMOD-2005-WangWZSPYH #database #named #scalability
- GraphMiner: a structural pattern-mining system for large disk-based graph databases and its applications (WW, CW, YZ, BS, JP, XY, JH), pp. 879–881.
- SIGMOD-2005-YanYH #database #similarity
- Substructure Similarity Search in Graph Databases (XY, PSY, JH), pp. 766–777.
- VLDB-2005-ChenGK #algorithm #pattern matching
- Stack-based Algorithms for Pattern Matching on DAGs (LC, AG, MEK), pp. 493–504.
- VLDB-2005-GibsonKT #scalability
- Discovering Large Dense Subgraphs in Massive Graphs (DG, RK, AT), pp. 721–732.
- VLDB-2005-KacholiaPCSDK #bidirectional #database #keyword
- Bidirectional Expansion For Keyword Search on Graph Databases (VK, SP, SC, SS, RD, HK), pp. 505–516.
- SCAM-2005-BermudoKH #assembly #control flow #re-engineering #source code
- Control Flow Graph Reconstruction for Assembly Language Programs with Delayed Instructions (NB, AK, RNH), pp. 107–118.
- CIAA-2005-Rytter #fibonacci #word
- The Structure of Subword Graphs and Suffix Trees of Fibonacci Words (WR), pp. 250–261.
- DLT-2005-Karianto #automaton
- Adding Monotonic Counters to Automata and Transition Graphs (KW), pp. 308–319.
- DLT-2005-Priese #set
- Semi-rational Sets of DAGs (LP), pp. 385–396.
- ICALP-2005-AvinE #geometry #on the #random
- On the Cover Time of Random Geometric Graphs (CA, GE), pp. 677–689.
- ICALP-2005-CohenFIKP #automaton #finite
- Label-Guided Graph Exploration by a Finite Automaton (RC, PF, DI, AK, DP), pp. 335–346.
- ICALP-2005-ConfortiMS #logic
- Spatial Logics for Bigraphs (GC, DM, VS), pp. 766–778.
- ICALP-2005-DimitrovP #process
- Optimal Cover Time for a Graph-Based Coupon Collector Process (NBD, CGP), pp. 702–716.
- ICALP-2005-EfthymiouS #on the #random
- On the Existence of Hamiltonian Cycles in Random Intersection Graphs (CE, PGS), pp. 690–701.
- ICALP-2005-FialaGK #bound #distance
- Distance Constrained Labelings of Graphs of Bounded Treewidth (JF, PAG, JK), pp. 360–372.
- ICALP-2005-GuT
- Optimal Branch-Decomposition of Planar Graphs in O(n3) Time (QPG, HT), pp. 373–384.
- ICALP-2005-Kavitha #algorithm #random
- An Õ(m2n) Randomized Algorithm to Compute a Minimum Cycle Basis of a Directed Graph (TK), pp. 273–284.
- ICALP-2005-KowalukL #query
- LCA Queries in Directed Acyclic Graphs (MK, AL), pp. 241–248.
- ICALP-2005-RodittyZ
- Replacement Paths and k Simple Shortest Paths in Unweighted Directed Graphs (LR, UZ), pp. 249–260.
- AIIDE-2005-RiedlY #branch #generative #linear
- From Linear Story Generation to Branching Story Graphs (MOR, RMY), pp. 111–116.
- SOFTVIS-2005-GhoniemCFJ #constraints #programming #using #visualisation
- Peeking in solver strategies using explanations visualization of dynamic graphs for constraint programming (MG, HC, JDF, NJ), pp. 27–36.
- SOFTVIS-2005-NoackL #layout #modelling
- A space of layout styles for hierarchical graph models of software systems (AN, CL), pp. 155–164.
- VISSOFT-2005-BalzerD #using
- Exploring Relations within Software Systems Using Treemap Enhanced Hierarchical Graphs (MB, OD), pp. 89–94.
- CAiSE-2005-TheodoratosD #query #using
- Querying Tree-Structured Data Using Dimension Graphs (DT, TD), pp. 201–215.
- ICEIS-v1-2005-YangLOA #generative #named #xml
- DWG2XML: Generating XML Nested Tree Structure from Directed Weighted Graph (KYY, ACWL, TÖ, RA), pp. 19–26.
- CIKM-2005-SrihariLB #approach #concept
- Unapparent information revelation: a concept chain graph approach (RKS, SL, AB), pp. 329–330.
- ICML-2005-FrohlichWSZ #kernel
- Optimal assignment kernels for attributed molecular graphs (HF, JKW, FS, AZ), pp. 225–232.
- ICML-2005-HerbsterPW #learning #online
- Online learning over graphs (MH, MP, LW), pp. 305–312.
- ICML-2005-KulisBDM #approach #clustering #kernel
- Semi-supervised graph clustering: a kernel approach (BK, SB, ISD, RJM), pp. 457–464.
- ICML-2005-LiuXC #predict #using
- Predicting protein folds with structural repeats using a chain graph model (YL, EPX, JGC), pp. 513–520.
- ICML-2005-SimsekWB #clustering #identification #learning
- Identifying useful subgoals in reinforcement learning by local graph partitioning (ÖS, APW, AGB), pp. 816–823.
- ICML-2005-ZhouHS #learning
- Learning from labeled and unlabeled data on a directed graph (DZ, JH, BS), pp. 1036–1043.
- ICML-2005-ZhuL #induction #learning #modelling #scalability
- Harmonic mixtures: combining mixture models and graph-based methods for inductive and scalable semi-supervised learning (XZ, JDL), pp. 1052–1059.
- KDD-2005-DhillonGK #algorithm #clustering #kernel #multi #performance
- A fast kernel-based multilevel algorithm for graph clustering (ISD, YG, BK), pp. 629–634.
- KDD-2005-GaoLZCM #clustering #consistency #higher-order #semistructured data
- Consistent bipartite graph co-partitioning for star-structured high-order heterogeneous data co-clustering (BG, TYL, XZ, QC, WYM), pp. 41–50.
- KDD-2005-GoethalsHB #mining #query
- Mining tree queries in a graph (BG, EH, JVdB), pp. 61–69.
- KDD-2005-JinWPPA #dataset
- Discovering frequent topological structures from graph datasets (RJ, CW, DP, SP, GA), pp. 606–611.
- KDD-2005-LeskovecKF
- Graphs over time: densification laws, shrinking diameters and possible explanations (JL, JMK, CF), pp. 177–187.
- KDD-2005-Yang
- Building connected neighborhood graphs for isometric data embedding (LY), pp. 722–728.
- KDD-2005-YanZH #constraints #mining #relational
- Mining closed relational graphs with connectivity constraints (XY, XJZ, JH), pp. 324–333.
- MLDM-2005-BarbuHAT #clustering #documentation #image #summary #using
- Clustering Document Images Using Graph Summaries (EB, PH, SA, ÉT), pp. 194–202.
- MLDM-2005-BunkeDIK #analysis #learning #predict
- Analysis of Time Series of Graphs: Prediction of Node Presence by Means of Decision Tree Learning (HB, PJD, CI, MK), pp. 366–375.
- MLDM-2005-FerrandizB #multi #recursion
- Multivariate Discretization by Recursive Supervised Bipartition of Graph (SF, MB), pp. 253–264.
- SIGIR-2005-ZhangLLJXFCM #using #web
- Improving web search results using affinity graph (BZ, HL, YL, LJ, WX, WF, ZC, WYM), pp. 504–511.
- OOPSLA-2005-GregorL #algorithm #parallel
- Lifting sequential graph algorithms for distributed-memory parallel computation (DG, AL), pp. 423–437.
- SAC-2005-JayadevaprakashMP #generative #transitive #using
- Generating association graphs of non-cooccurring text objects using transitive methods (NJ, SM, MJP), pp. 141–145.
- SAC-2005-LimZLR #heuristic #problem
- Heuristic methods for graph coloring problems (AL, YZ, QL, BR), pp. 933–939.
- SAC-2005-McPhersonMO #clustering #parametricity #social
- Discovering parametric clusters in social small-world graphs (JM, KLM, MO), pp. 1231–1238.
- CASE-2005-AlenljungL #modelling
- Simplified modeling of manufacturing systems: an introduction to sensor activation graphs (TA, BL), pp. 261–266.
- CASE-2005-LeeP #analysis #constraints
- Steady state analysis of a timed event graph with time window constraints (TEL, SHP), pp. 404–409.
- CGO-2005-ArnoldG #virtual machine
- Collecting and Exploiting High-Accuracy Call Graph Profiles in Virtual Machines (MA, DG), pp. 51–62.
- DAC-2005-GeilenBS #data flow #model checking #requirements
- Minimising buffer requirements of synchronous dataflow graphs with model checking (MG, TB, SS), pp. 819–824.
- DATE-2005-HanlaiMJ #control flow #memory management #optimisation #performance #using
- Extended Control Flow Graph Based Performance Optimization Using Scratch-Pad Memory (PH, LM, JJ), pp. 828–829.
- DATE-2005-LiuFYO #analysis #correlation #modelling
- Hierarchical Variance Analysis for Analog Circuits Based on Graph Modelling and Correlation Loop Tracing (FL, JJF, DVY, SO), pp. 126–131.
- DATE-2005-TeslenkoD #algorithm #performance
- An Efficient Algorithm for Finding Double-Vertex Dominators in Circuit Graphs (MT, ED), pp. 406–411.
- PDP-2005-FernandezM #energy #novel
- A Novel Energy Model for MANETs based on Graphs with Activation Windows (DSF, PM), pp. 126–133.
- PDP-2005-VallejoBM
- Practicable Layouts for Optimal Circulant Graphs (EV, RB, CM), pp. 118–125.
- FASE-2005-TaentzerR #constraints #inheritance #modelling
- Ensuring Structural Constraints in Graph-Based Models with Type Inheritance (GT, AR), pp. 64–79.
- STOC-2005-AchlioptasCKM #bias #on the
- On the bias of traceroute sampling: or, power-law degree distributions in regular graphs (DA, AC, DK, CM), pp. 694–703.
- STOC-2005-AlonMMN #polynomial
- Quadratic forms on graphs (NA, KM, YM, AN), pp. 486–493.
- STOC-2005-AlonS
- Every monotone graph property is testable (NA, AS), pp. 128–137.
- STOC-2005-BarakKSSW #independence #simulation
- Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors (BB, GK, RS, BS, AW), pp. 1–10.
- STOC-2005-FischerN #estimation #testing
- Testing versus estimation of graph properties (EF, IN), pp. 138–146.
- STOC-2005-Garg #approximate #problem
- Saving an epsilon: a 2-approximation for the k-MST problem in graphs (NG), pp. 396–402.
- STOC-2005-Goncalves
- Edge partition of planar sraphs into two outerplanar graphs (DG0), pp. 504–512.
- STOC-2005-HajiaghayiKLR #random
- Oblivious routing in directed graphs with random demands (MTH, JHK, TL, HR), pp. 193–201.
- CSL-2005-CourcelleD #composition #higher-order #logic #monad
- The Modular Decomposition of Countable Graphs: Constructions in Monadic Second-Order Logic (BC, CD), pp. 325–338.
- ICLP-2005-SahaR #data type #evaluation #incremental #performance
- Symbolic Support Graph: A Space Efficient Data Structure for Incremental Tabled Evaluation (DS, CRR), pp. 235–249.
- ECDL-2004-BoutinH #multi
- Multi-level Exploration of Citation Graphs (FB, MH), pp. 366–377.
- SIGMOD-2004-YanYH #approach
- Graph Indexing: A Frequent Structure-based Approach (XY, PSY, JH), pp. 335–346.
- ICSM-2004-Balmas #data flow #named #visualisation
- DDFgraph: A Tool for Dynamic Data Flow Graphs Visualization (FB), p. 516.
- ICSM-2004-IshioKI #aspect-oriented #debugging #slicing
- Debugging Support for Aspect-Oriented Program Based on Program Slicing and Call Graph (TI, SK, KI), pp. 178–187.
- ICSM-2004-LuoJZMS #analysis #case study #component #object-oriented
- An Experimental Study of Two Graph Analysis Based Component Capture Methods for Object-Oriented Systems (JL, RJ, LZ, HM, JS), pp. 390–398.
- DLT-2004-Courcelle #overview #relational #set
- Recognizable Sets of Graphs, Hypergraphs and Relational Structures: A Survey (BC), pp. 1–11.
- DLT-2004-EpifanioMSV
- Sturmian Graphs and a Conjecture of Moser (CE, FM, JS, IV), pp. 175–187.
- ICALP-2004-ArgeMT #algorithm #memory management
- External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs (LA, UM, LT), pp. 146–157.
- ICALP-2004-Coja-Oghlan
- Coloring Semirandom Graphs Optimally (ACO), pp. 383–395.
- ICALP-2004-DurrHHM #complexity #problem #quantum #query
- Quantum Query Complexity of Some Graph Problems (CD, MH, PH, MM), pp. 481–493.
- ICALP-2004-FeigenbaumKMSZ #on the #problem
- On Graph Problems in a Semi-streaming Model (JF, SK, AM, SS, JZ), pp. 531–543.
- ICALP-2004-FominT #algorithm #exponential #kernel #linear #performance
- Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-Up (FVF, DMT), pp. 581–592.
- ICALP-2004-HalevyK #testing
- Testing Monotonicity over Graph Products (SH, EK), pp. 721–732.
- ICALP-2004-KavithaMMP #algorithm #performance
- A Faster Algorithm for Minimum Cycle Basis of Graphs (TK, KM, DM, KEP), pp. 846–857.
- ICALP-2004-NikoletseasRS #independence #performance #random #scalability #set
- The Existence and Efficient Construction of Large Independent Sets in General Random Intersection Graphs (SEN, CR, PGS), pp. 1029–1040.
- FLOPS-2004-Ogawa #algebra #axiom
- Complete Axiomatization of an Algebraic Construction of Graphs (MO), pp. 163–179.
- ICGT-2004-BeckerLW #execution #incremental #integration #interactive #tool support
- Rule Execution in Graph-Based Incremental Interactive Integration Tools (SMB, SL, BW), pp. 22–38.
- ICGT-2004-EhrigEHP #constraints
- Constraints and Application Conditions: From Graphs to High-Level Structures (HE, KE, AH, KHP), pp. 287–303.
- ICGT-2004-PlumpS #algorithm #source code #towards
- Towards Graph Programs for Graph Algorithms (DP, SS), pp. 128–143.
- ICGT-2004-Rensink #first-order #logic #representation #using
- Representing First-Order Logic Using Graphs (AR), pp. 319–335.
- ICGT-2004-Sandhu #data access #modelling
- A Perspective on Graphs and Access Control Models (RSS), pp. 2–12.
- CSCW-2004-SaltzHT #network #online #social #student #visualisation
- Student social graphs: visualizing a student’s online social network (JSS, SRH, MT), pp. 596–599.
- ICEIS-v1-2004-JuniorV #algorithm #relational #xml
- Keys Graph — Based Relational to XML Translation Algorithm (WMdAJ, CV), pp. 142–148.
- ICEIS-v2-2004-BendouM #learning #network
- Learning Bayesian Networks with Largest Chain Graphs (MB, PM), pp. 184–190.
- CIKM-2004-ChitrapuraK #ranking
- Node ranking in labeled directed graphs (KPC, SRK), pp. 597–606.
- CIKM-2004-TomitaNI #representation #similarity #using
- Calculating similarity between texts using graph-based text representation model (JT, HN, MI), pp. 248–249.
- ICML-2004-FernB #clustering #problem
- Solving cluster ensemble problems by bipartite graph partitioning (XZF, CEB).
- ICML-2004-KashimaT #algorithm #kernel #learning #sequence
- Kernel-based discriminative learning algorithms for labeling sequences, trees, and graphs (HK, YT).
- ICML-2004-MaheUAPV #kernel
- Extensions of marginalized graph kernels (PM, NU, TA, JLP, JPV).
- ICPR-v1-2004-KimYL #algorithm #distance #relational #using
- A New Attributed Relational Graph Matching Algorithm Using the Nested Structure of Earth Mover’s Distance (DHK, IDY, SUL), pp. 48–51.
- ICPR-v1-2004-VirmajokiF #algorithm #clustering #divide and conquer
- Divide-and-Conquer Algorithm for Creating Neighborhood Graph for Clustering (OV, PF), pp. 264–267.
- ICPR-v1-2004-Yang04a #distance #estimation
- k-Edge Connected Neighborhood Graph for Geodesic Distance Estimation and Nonlinear Data Projection (LY), pp. 196–199.
- ICPR-v2-2004-LourakisAM #approach #information management #similarity #using
- A Graph-Based Approach to Corner Matching Using Mutual Information as a Local Similarity Measure (MIAL, AAA, KM), pp. 827–830.
- ICPR-v2-2004-LuCY #approach #composition
- A Graph Decomposition Approach to Least Squares Attributed Graph Matching (JL, TC, JYY), pp. 471–474.
- ICPR-v2-2004-SukF #generative #invariant
- Graph Method for Generating Affine Moment Invariants (TS, JF), pp. 192–195.
- ICPR-v2-2004-TabboneW04a #image #relational
- Retrieving Images by Content from Strong Relational Graph Matching (ST, LW), pp. 951–954.
- ICPR-v2-2004-UnslanB #development #metric
- A Theoretical and Experimental Investigation of Graph Theoretical Measures for Land Development in Satellite Imagery (CÜ, KLB), pp. 64–67.
- ICPR-v2-2004-WilsonH #distance
- Levenshtein Distance for Graph Spectral Features (RCW, ERH), pp. 489–492.
- ICPR-v2-2004-YuXA #sequence #using #video
- Reconstructing a Dynamic Surface from Video Sequences Using Graph Cuts in 4D Space-Time (TY, NX, NA), pp. 245–248.
- ICPR-v3-2004-BaiYH #using
- Graph Matching using Spectral Embedding and Alignment (XB, HY, ERH), pp. 398–401.
- ICPR-v3-2004-DePiero #bound #memory management #polynomial #worst-case
- Structural Graph Matching With Polynomial Bounds On Memory and on Worst-Case Effort (FWD), pp. 379–382.
- ICPR-v3-2004-GoriMS #random #using
- Graph matching using Random Walks (MG, MM, LS), pp. 394–397.
- ICPR-v3-2004-HautamakiKF #detection #nearest neighbour #using
- Outlier Detection Using k-Nearest Neighbour Graph (VH, IK, PF), pp. 430–433.
- ICPR-v3-2004-IrnigerB #database #using
- Graph Database Filtering Using Decision Trees (CI, HB), pp. 383–388.
- ICPR-v3-2004-JiangN #image
- Graph Based Image Matching (HJ, CWN), pp. 658–661.
- ICPR-v3-2004-LiSH #estimation #feedback #image #retrieval
- Image Retrieval with Relevance Feedback Based on Graph-Theoretic Region Correspondence Estimation (CYL, MCS, CTH), pp. 842–845.
- ICPR-v3-2004-LuoWH
- Graph Manifolds from Spectral Polynomials (BL, RCW, ERH), pp. 402–405.
- ICPR-v3-2004-NeuhausB #approach #distance #edit distance #learning #probability
- A Probabilistic Approach to Learning Costs for Graph Edit Distance (MN, HB), pp. 389–393.
- ICPR-v4-2004-FigueroaLBCM #representation #using
- Tracking Soccer Players using the Graph Representation (PJF, NJL, RMLB, IC, GGM), pp. 787–790.
- ICPR-v4-2004-HeroorC #detection #segmentation
- Affine Layer Segmentation and Adjacency Graphs for Vortex Detection (SH, IC), pp. 223–226.
- ICPR-v4-2004-ParkJZK #clustering
- Support Vector Clustering Combined with Spectral Graph Partitioning (JHP, XJ, HZ, RK), pp. 581–584.
- ICPR-v4-2004-XuTAA #generative #image #using
- Generating Omnifocus Images Using Graph Cuts and a New Focus Measure (NX, KHT, HA, NA), pp. 697–700.
- ICPR-v4-2004-ZhangKZ #image #retrieval #semantics
- Region Based a-Semantics Graph Driven Image Retrieval (RZ, SK, Z(Z), pp. 909–912.
- KDD-2004-HorvathGW #kernel #mining #predict
- Cyclic pattern kernels for predictive graph mining (TH, TG, SW), pp. 158–167.
- KDD-2004-HuanWPY #database #mining #named
- SPIN: mining maximal frequent subgraphs from graph databases (JH, WW, JP, JY), pp. 581–586.
- KDD-2004-JehW #mining
- Mining the space of graph properties (GJ, JW), pp. 187–196.
- KDD-2004-KumarMS #approach
- A graph-theoretic approach to extract storylines from search results (RK, UM, DS), pp. 216–225.
- KDD-2004-WangWPZS #database #mining #scalability
- Scalable mining of large disk-based graph databases (CW, WW, JP, YZ, BS), pp. 316–325.
- KR-2004-Baget #algorithm #concept
- Improving the Forward Chaining Algorithm for Conceptual Graphs Rules (JFB), pp. 407–414.
- KR-2004-Geffner #compilation
- Planning Graphs and Knowledge Compilation (HG), pp. 662–672.
TOOLS-USA-2003-ArdourelH04 #eiffel- Class-based Visibility from an MDA Perspective: From Access Graphs to Eiffel Code (GA, MH), pp. 177–195.
- LOPSTR-2004-WellsY #proving #synthesis
- Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis (JBW, BY), pp. 262–277.
- PLDI-2004-SmithRH #algorithm
- A generalized algorithm for graph-coloring register allocation (MDS, NR, GHH), pp. 277–288.
- SAS-2004-HymansU #data flow #dependence #static analysis
- Static Analysis of Gated Data Dependence Graphs (CH, EU), pp. 197–211.
- SAC-2004-ChenC #database #object-oriented
- Signature file hierarchies and signature graphs: a new index method for object-oriented databases (YC, YC), pp. 724–728.
- SAC-2004-Hosobe04a #approach #interactive #visualisation
- A high-dimensional approach to interactive graph visualization (HH), pp. 1253–1257.
- SAC-2004-RahmaniK #strict
- Degree restricted spanning trees of graphs (MSR, AK), pp. 225–228.
- SAC-2004-RuckertK
- Frequent free tree discovery in graph data (UR, SK), pp. 564–570.
GPCE-2004-HauserK #compilation #execution #process- Compiling Process Graphs into Executable Code (RH, JK), pp. 317–336.
- DAC-2004-KwonKK #functional #metric #synthesis
- Systematic functional coverage metric synthesis from hierarchical temporal event relation graph (YSK, YIK, CMK), pp. 45–48.
- DATE-v1-2004-KwonK #functional #generative #metric
- Functional Coverage Metric Generation from Temporal Event Relation Graph (YSK, CMK), pp. 670–671.
- DATE-v1-2004-MishraD #functional #generative #pipes and filters
- Graph-Based Functional Test Program Generation for Pipelined Processors (PM, ND), pp. 182–187.
- DATE-v1-2004-RamaniAMS #independence #symmetry
- Breaking Instance-Independent Symmetries in Exact Graph Coloring (AR, FAA, ILM, KAS), pp. 324–331.
- LCTES-2004-ZengSE #concurrent #dependence #generative #performance
- Generating fast code from concurrent program dependence graphs (JZ, CS, SAE), pp. 175–181.
- PDP-2004-BanosGOM #clustering #heuristic #parallel
- Parallel Heuristic Search in Multilevel Graph Partitioning (RB, CG, JO, FGM), pp. 88–95.
- ESOP-2004-Rensink #canonical
- Canonical Graph Shapes (AR), pp. 401–415.
- STOC-2004-AchlioptasN #random
- The two possible values of the chromatic number of a random graph (DA, AN), pp. 587–593.
- STOC-2004-AroraRV #clustering #geometry
- Expander flows, geometric embeddings and graph partitioning (SA, SR, UVV), pp. 222–231.
- STOC-2004-CorreaG #approximate #theorem
- An approximate König’s theorem for edge-coloring weighted bipartite graphs (JRC, MXG), pp. 398–406.
- STOC-2004-Feige #bound #independence #on the #random
- On sums of independent random variables with unbounded variance, and estimating the average degree in a graph (UF), pp. 594–603.
- STOC-2004-Fischer #morphism #testing
- The difficulty of testing for isomorphism against a graph that is given in advance (EF), pp. 391–397.
- STOC-2004-GoelRK #geometry #random
- Sharp thresholds For monotone properties in random geometric graphs (AG, SR, BK), pp. 580–586.
- STOC-2004-Kelner #bound #clustering
- Spectral partitioning, eigenvalue bounds, and circle packings for graphs of bounded genus (JAK), pp. 455–464.
- STOC-2004-KortsarzN #algorithm #approximate
- Approximation algorithm for k-node connected subgraphs via critical graphs (GK, ZN), pp. 138–145.
- STOC-2004-RodittyZ #algorithm #linear #reachability
- A fully dynamic reachability algorithm for directed graphs with an almost linear update time (LR, UZ), pp. 184–191.
- STOC-2004-SpielmanT #algorithm #clustering #linear
- Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems (DAS, SHT), pp. 81–90.
- STOC-2004-Yao #problem #quantum #sorting
- Graph entropy and quantum sorting problems (ACCY), pp. 112–117.
- TACAS-2004-MailundW #reachability #using
- Obtaining Memory-Efficient Reachability Graph Representations Using the Sweep-Line Method (TM, MW), pp. 177–191.
- CSL-2004-Gimbert #game studies #infinity
- Parity and Exploration Games on Infinite Graphs (HG), pp. 56–70.
- LICS-2004-BucciarelliS #λ-calculus
- The Sensible Graph Theories of λ Calculus (AB, AS), pp. 276–285.
- LICS-2004-Bulatov #constraints #problem #relational
- A Graph of a Relational Structure and Constraint Satisfaction Problems (AAB), pp. 448–457.
- LICS-2004-DalmauKL #first-order #problem #reflexive
- First-Order Definable Retraction Problems for Posets and Reflexive Graph (VD, AAK, BL), pp. 232–241.
VMCAI-2004-Etessami #analysis #data flow #equation #game studies #recursion #using- Analysis of Recursive Game Graphs Using Data Flow Equations (KE), pp. 282–296.
- ICDAR-2003-SchenkerLBK #classification #documentation #using #web
- Classification of Web Documents Using a Graph Model (AS, ML, HB, AK), pp. 240–244.
- ICSM-2003-SartipiK #architecture #modelling #on the
- On Modeling Software Architecture Recovery as Graph Matching (KS, KK), pp. 224–234.
IWPC-2003-ChiricotaJM #clustering #component #using- Software Components Capture Using Graph Clustering (YC, FJ, GM), pp. 217–226.
- IWPC-2003-HopfnerSG #visualisation #xml
- Comprehending and Visualizing Software Based on XML — Representations and Call Graphs (MH, DS, JWvG), pp. 290–291.
- SCAM-2003-BinkleyH #algorithm #analysis #optimisation #performance #reachability #scalability #source code
- Results from a Large-Scale Study of Performance Optimization Techniques for Source Code Analyses Based on Graph Reachability Algorithms (DB, MH), p. 203–?.
- SCAM-2003-WalkinshawRW #dependence #java
- The Java System Dependence Graph (NW, MR, MW), pp. 55–64.
- CIAA-2003-MiyamotoITS #word
- Ternary Directed Acyclic Word Graphs (SM, SI, MT, AS), pp. 120–130.
- ICALP-2003-BaswanaS #algorithm #linear
- A Simple Linear Time Algorithm for Computing a (2k-1)-Spanner of O(n1+1/k) Size in Weighted Graphs (SB, SS), pp. 384–296.
- ICALP-2003-BlondelD #matrix #similarity
- Similarity Matrices for Pairs of Graphs (VDB, PVD), pp. 739–750.
- ICALP-2003-BodirskyGK #generative #random
- Generating Labeled Planar Graphs Uniformly at Random (MB, CG, MK), pp. 1095–1107.
- ICALP-2003-Cachat #automaton #game studies #higher-order
- Higher Order Pushdown Automata, the Caucal Hierarchy of Graphs and Parity Games (TC), pp. 556–569.
- ICALP-2003-ChenKPSX #complexity #problem
- Genus Characterizes the Complexity of Graph Problems: Some Tight Results (JC, IAK, LP, ES, GX), pp. 845–856.
- ICALP-2003-Coja-OghlanMS #approximate #random
- MAX k-CUT and Approximating the Chromatic Number of Random Graphs (ACO, CM, VS), pp. 200–211.
- ICALP-2003-DemaineFHT #algorithm #parametricity
- Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs (EDD, FVF, MTH, DMT), pp. 829–844.
- ICALP-2003-GarganoH #how
- There Are Spanning Spiders in Dense Graphs (and We Know How to Find Them) (LG, MH), pp. 802–816.
- ICALP-2003-IkedaKOY #finite #random
- Impact of Local Topological Information on Random Walks on Finite Graphs (SI, IK, NO, MY), pp. 1054–1067.
- ICALP-2003-Mutzel #data type
- The SPQR-Tree Data Structure in Graph Drawing (PM), pp. 34–46.
- FME-2003-ArmandoCG #analysis #model checking #protocol #satisfiability #security #using
- SAT-Based Model-Checking of Security Protocols Using Planning Graph Analysis (AA, LC, PG), pp. 875–893.
- AGTIVE-2003-AgnarssonEH
- Proper Down-Coloring Simple Acyclic Digraphs (GA, ÁSE, MMH), pp. 299–312.
- AGTIVE-2003-BakewellPR #pointer #reduction #specification
- Specifying Pointer Structures by Graph Reduction (AB, DP, CR), pp. 30–44.
- AGTIVE-2003-Bohlen #modelling
- Specific Graph Models and Their Mappings to a Common Model (BB), pp. 45–60.
- AGTIVE-2003-Gatzemeier03a #authoring #named
- CHASID — A Graph-Based Authoring Support System (FHG), pp. 420–426.
- AGTIVE-2003-HellerJ #development #distributed #process #tool support
- Graph-Based Tools for Distributed Cooperation in Dynamic Development Processes (MH, DJ), pp. 352–368.
- AGTIVE-2003-HellerSW #development #evolution #process #specification
- Graph-Based Specification of a Management System for Evolving Development Processes (MH, AS, BW), pp. 334–351.
- AGTIVE-2003-Jamison
- Transforming Toric Digraphs (REJ), pp. 328–333.
- AGTIVE-2003-SzubaOS #concept #design #on the
- On Graphs in Conceptual Engineering Design (JS, AO, AS), pp. 75–89.
- SOFTVIS-2003-CollbergKNPW #evolution #visualisation
- A System for Graph-Based Visualization of the Evolution of Software (CSC, SGK, JN, JP, KW), pp. 77–86.
- SOFTVIS-2003-ZhouSC #analysis #visualisation
- Graph Visualization for the Analysis of the Structure and Dynamics of Extreme-Scale Supercomputers (CZ, KLS, TPC), pp. 143–149.
- VISSOFT-2003-HassanH #comprehension #dependence #named
- ADG: Annotated Dependency Graphs for Software Understanding (AEH, RCH), pp. 41–45.
- ICEIS-v4-2003-SonneckM #personalisation #using #web
- One-To-One Personalization of Web Applications Using a Graph Based Model (GS, TAM), pp. 95–102.
- CIKM-2003-AbelloK
- Hierarchical graph indexing (JA, YK), pp. 453–460.
- ICML-2003-Joachims #clustering #learning
- Transductive Learning via Spectral Graph Partitioning (TJ), pp. 290–297.
- ICML-2003-KashimaTI #kernel
- Marginalized Kernels Between Labeled Graphs (HK, KT, AI), pp. 321–328.
- ICML-2003-KubicaMCS #analysis #collaboration #performance #query
- Finding Underlying Connections: A Fast Graph-Based Method for Link Analysis and Collaboration Queries (JK, AWM, DC, JGS), pp. 392–399.
- KDD-2003-NobleC #detection
- Graph-based anomaly detection (CCN, DJC), pp. 631–636.
- KDD-2003-YanH #mining #named
- CloseGraph: mining closed frequent graph patterns (XY, JH), pp. 286–295.
- MLDM-2003-Barsi #self #using
- Neural Self-Organization Using Graphs (AB), pp. 343–352.
- MLDM-2003-Bunke #data mining #machine learning #mining #tool support
- Graph-Based Tools for Data Mining and Machine Learning (HB), pp. 7–19.
- SEKE-2003-HuangL #abstraction #automation #similarity #visualisation
- Automatic Abstraction of Graphs Based on Node Similarity for Graph Visualization (XH, WL), pp. 111–118.
- SIGIR-2003-Broder #modelling #using #web
- Keynote Address — exploring, modeling, and using the web graph (AZB), p. 1.
- POPL-2003-CarterFT
- Folklore confirmed: reducible flow graphs are exponentially larger (LC, JF, CDT), pp. 106–114.
- POPL-2003-JensenM
- Bigraphs and transitions (OHJ, RM), pp. 38–49.
- ASE-2003-SabetzadehE #analysis #approach #consistency #nondeterminism
- Analysis of Inconsistency in Graph-Based Viewpoints: A Category-Theoretic Approach (MS, SME), pp. 12–21.
- ICSE-2003-BaniassadMS #design pattern
- Design Pattern Rationale Graphs: Linking Design to Source (ELAB, GCM, CS), pp. 352–362.
- CC-2003-Andersson
- Register Allocation by Optimal Graph Coloring (CA), pp. 33–45.
- CC-2003-JohnsonM #dependence #using
- Combined Code Motion and Register Allocation Using the Value State Dependence Graph (NJ, AM), pp. 1–16.
- DAC-2003-BozorgzadehGTS #integer
- Optimal integer delay budgeting on directed acyclic graphs (EB, SG, AT, MS), pp. 920–925.
- DAC-2003-MemikMJK #data flow #resource management #synthesis
- Global resource sharing for synthesis of control data flow graphs on FPGAs (SOM, GM, RJ, EK), pp. 604–609.
- DAC-2003-SzymanekK #constraints
- Partial task assignment of task graphs under heterogeneous resource constraints (RS, KK), pp. 244–249.
- DATE-2003-KimSLLNN #data flow #distributed
- Distributed Synchronous Control Units for Dataflow Graphs under Allocation of Telescopic Arithmetic Units (EK, HS, JGL, DIL, HN, TN), pp. 10276–10281.
- DATE-2003-WuAE #embedded #power management #scheduling #synthesis
- Scheduling and Mapping of Conditional Task Graphs for the Synthesis of Low Power Embedded Systems (DW, BMAH, PE), pp. 10090–10095.
- LCTES-2003-GuoSBH #algorithm #configuration management
- A graph covering algorithm for a coarse grain reconfigurable system (YG, GJMS, HB, PMH), pp. 199–208.
- STOC-2003-AlonS #testing
- Testing subgraphs in directed graphs (NA, AS), pp. 700–709.
- STOC-2003-AmirKR #approximate #constant
- Constant factor approximation of vertex-cuts in planar graphs (EA, RK, SR), pp. 90–99.
- STOC-2003-DietzfelbingerW #random
- Almost random graphs with simple hash functions (MD, PW), pp. 629–638.
- STOC-2003-GaoZ #composition #metric
- Well-separated pair decomposition for the unit-disk graph metric and its applications (JG, LZ), pp. 483–492.
- STOC-2003-Hayes
- Randomly coloring graphs of girth at least five (TPH), pp. 269–278.
- STOC-2003-KimV #generative #random
- Generating random regular graphs (JHK, VHV), pp. 213–222.
- STOC-2003-KowalikK #constant #query
- Short path queries in planar graphs in constant time (LK, MK), pp. 143–148.
- STOC-2003-KrauthgamerL
- The intrinsic dimensionality of graphs (RK, JRL), pp. 438–447.
- STOC-2003-SauerhoffW #bound #integer #multi #trade-off
- Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions (MS, PW), pp. 186–195.
- TACAS-2003-AlurTM #composition #game studies #recursion
- Modular Strategies for Recursive Game Graphs (RA, SLT, PM), pp. 363–378.
- CAV-2003-AlurTM #composition #game studies #infinity #recursion
- Modular Strategies for Infinite Games on Recursive Graphs (RA, SLT, PM), pp. 67–79.
- LICS-2003-Lynch #convergence #random #sequence
- Convergence Law for Random Graphs with Specified Degree Sequence (JFL), p. 301–?.
- SAT-2003-MneimnehS #scalability
- Computing Vertex Eccentricity in Exponentially Large Graphs: QBF Formulation and Solution (MNM, KAS), pp. 411–425.
- JCDL-2002-HuangCOC #library #recommendation
- A graph-based recommender system for digital library (ZH, WC, THO, HC), pp. 65–73.
- PODS-2002-ShashaWG #algorithm
- Algorithmics and Applications of Tree and Graph Searching (DS, JTLW, RG), pp. 39–52.
- VLDB-2002-PolyzotisG #xml
- Structure and Value Synopses for XML Data Graphs (NP, MNG), pp. 466–477.
- CSMR-2002-Baburin #re-engineering #using
- Using Graph Based Representations in Reengineering (DEB), pp. 203–206.
- CSMR-2002-RaysideK #algorithm #problem #program analysis #reachability
- A Generic Worklist Algorithm for Graph Reachability Problems in Program Analysis (DR, KK), pp. 67–76.
- IWPC-2002-WuHH #using
- Using Graph Patterns to Extract Scenarios (JW, AEH, RCH), pp. 239–247.
- PASTE-2002-Fiskio-LasseterY #equation #programming
- Flow equations as a generic programming tool for manipulation of attributed graphs (JHEFL, MY), pp. 69–76.
- SCAM-2002-Balmas #dependence #documentation #source code #using
- Using Dependence Graphs as a Support to Document Programs (FB), pp. 145–154.
- SCAM-2002-MilanovaRR #pointer #precise
- Precise Call Graph Construction in the Presence of Function Pointers (AM, AR, BGR), pp. 155–162.
- SCAM-2002-RiccaT #dependence #slicing #web
- Construction of the System Dependence Graph for Web Application Slicing (FR, PT), pp. 123–132.
- WCRE-2002-TahvildariK #maintenance #using
- A Methodology for Developing Transformations Using the Maintainability Soft-Goal Graph (LT, KK), p. 77–?.
- DLT-2002-Urvoy #product line
- Abstract Families of Graphs (TU), pp. 381–392.
- ICALP-2002-AdlerRSSV #random
- Randomized Pursuit-Evasion in Graphs (MA, HR, NS, CS, BV), pp. 901–912.
- ICALP-2002-Cachat #automaton #game studies #synthesis
- Symbolic Strategy Synthesis for Games on Pushdown Graphs (TC), pp. 704–715.
- ICALP-2002-CardelliGG #logic #query
- A Spatial Logic for Querying Graphs (LC, PG, GG), pp. 597–610.
- ICALP-2002-Colcombet #decidability #first-order #on the #product line #reachability
- On Families of Graphs Having a Decidable First Order Theory with Reachability (TC), pp. 98–109.
- ICALP-2002-PapazianR #automaton #recognition
- Hyperbolic Recognition by Graph Automata (CP, ER), pp. 330–342.
- ICALP-2002-Pettie #algorithm #performance
- A Faster All-Pairs Shortest Path Algorithm for Real-Weighted Sparse Graphs (SP), pp. 85–97.
- ICALP-2002-Uehara #algorithm #linear
- Linear Time Algorithms on Chordal Bipartite and Strongly Chordal Graphs (RU), pp. 993–1004.
- IFL-2002-BoisLT #concurrent #migration #parallel #reduction #thread
- Thread Migration in a Parallel Graph Reducer (ARDB, HWL, PWT), pp. 199–214.
- ICGT-2002-BauderonC #symmetry
- Decomposing Graphs with Symmetries (MB, FC), pp. 45–59.
- ICGT-2002-GodardMMS #algorithm #detection #distributed #termination
- Termination Detection of Distributed Algorithms by Graph Relabelling Systems (EG, YM, MM, AS), pp. 106–119.
- ICGT-2002-HageHW
- Euler Graphs, Triangle-Free Graphs and Bipartite Graphs in Switching Classes (JH, TH, EW), pp. 148–160.
- ICGT-2002-KochP #constraints #policy
- Describing Policies with Graph Constraints and Rules (MK, FPP), pp. 223–238.
- ICGT-2002-MarburgerW #re-engineering
- Graph-Based Reengineering of Telecommunication Systems (AM, BW), pp. 270–285.
- ICGT-2002-Milner #interactive #mobile
- Bigraphs as a Model for Mobile Interaction (RM), pp. 8–13.
- ICGT-2002-SzubaSB #concept #design #named
- GraCAD — Graph-Based Tool for Conceptual Design (JS, AS, AB), pp. 363–377.
- CAiSE-2002-AalstHV #workflow
- An Alternative Way to Analyze Workflow Graphs (WMPvdA, AH, EV), pp. 535–552.
- CIKM-2002-RajaramanT #approach #concept #information management
- Knowledge discovery from texts: a concept frame graph approach (KR, AHT), pp. 669–671.
- ICML-2002-GonzalezHC #concept #learning #relational
- Graph-Based Relational Concept Learning (JAG, LBH, DJC), pp. 219–226.
- ICML-2002-KondorL #kernel
- Diffusion Kernels on Graphs and Other Discrete Input Spaces (RK, JDL), pp. 315–322.
- ICPR-v2-2002-CardotL #network #pattern matching #pattern recognition #recognition
- Graph of Neural Networks for Pattern Recognition (HC, OL), pp. 873–876.
- ICPR-v2-2002-CesarBB #optimisation #probability #recognition #using
- Inexact Graph Matching Using Stochastic Optimization Techniques for Facial Feature Recognition (RMC, EB, IB), pp. 465–468.
- ICPR-v2-2002-GiugnoS #named #performance #query
- GraphGrep: A Fast and Universal Method for Querying Graphs (RG, DS), pp. 112–115.
- ICPR-v2-2002-LuoWH #component #independence
- The Independent and Principal Component of Graph Spectra (BL, RCW, ERH), pp. 164–167.
- ICPR-v2-2002-RiviereMMTPF #learning #markov #random #relational #using
- Relational Graph Labelling Using Learning Techniques and Markov Random Fields (DR, JFM, JMM, FT, DPO, VF), pp. 172–175.
- ICPR-v2-2002-SerratosaSA #3d #modelling #multi #using
- Modelling and Recognising 3D-Objects Described by Multiple Views Using Function-Described Graphs (FS, AS, RA), pp. 140–143.
- ICPR-v3-2002-BadawyK #representation #using
- Shape Representation Using Concavity Graphs (OEB, MK), pp. 461–464.
- ICPR-v3-2002-LuoWH02a #approach #learning
- Graph Spectral Approach for Learning View Structure (BL, RCW, ERH), pp. 785–788.
- ICPR-v3-2002-MacriniSDSZ #3d #recognition #using
- View-Based 3-D Object Recognition using Shock Graphs (DM, AS, SJD, KS, SWZ), p. 24–?.
- ICPR-v4-2002-HlaouiW #algorithm
- A New Algorithm for Inexact Graph Matching (AH, SW), pp. 180–183.
- KDD-2002-PalmerGF #data mining #mining #named #performance #scalability
- ANF: a fast and scalable tool for data mining in massive graphs (CRP, PBG, CF), pp. 81–90.
- SIGIR-2002-ZhaJ #correlation #documentation #modelling #multi
- Correlating multilingual documents via bipartite graph modeling (HZ, XJ), pp. 443–444.
- PEPM-2002-SecherS
- From checking to inference via driving and dag grammars (JPS, MHS), pp. 41–51.
- PLDI-2002-KosekiKN
- Preference-Directed Graph Coloring (AK, HK, TN), pp. 33–44.
- SAS-2002-Mine #abstract domain #relational
- A Few Graph-Based Relational Numerical Abstract Domains (AM), pp. 117–132.
- ICSE-2002-BlausteinOB #sequence chart
- Observing timed systems by means of message sequence chart graphs (SB, FO, VAB), p. 707.
- ICSE-2002-EshuisW #design #process #uml #verification #workflow
- Verification support for workflow design with UML activity graphs (RE, RW), pp. 166–176.
- ICSE-2002-RobillardM #dependence #using
- Concern graphs: finding and describing concerns using structural program dependencies (MPR, GCM), pp. 406–416.
- ICSE-2002-RobschinkS #dependence #performance
- Efficient path conditions in dependence graphs (TR, GS), pp. 478–488.
- SAC-2002-ButenkoPSSS #independence #set
- Finding maximum independent sets in graphs arising from coding theory (SB, PMP, IS, VS, PS), pp. 542–546.
- CC-2002-AgrawalLS
- Evaluating a Demand Driven Technique for Call Graph Construction (GA, JL, QS), pp. 29–45.
- DAC-2002-MadesG #modelling #using
- Regularization of hierarchical VHDL-AMS models using bipartite graphs (JM, MG), pp. 548–551.
- DAC-2002-MoonKB #reduction
- Timing model extraction of hierarchical blocks by graph reduction (CWM, HK, KPB), pp. 152–157.
- DAC-2002-OhH #data flow #multi #performance #synthesis
- Efficient code synthesis from extended dataflow graphs for multimedia applications (HO, SH), pp. 275–280.
- LCTES-SCOPES-2002-ChoPW #algorithm #architecture #memory management #performance
- Efficient register and memory assignment for non-orthogonal architectures via graph coloring and MST algorithms (JC, YP, DBW), pp. 130–138.
- FoSSaCS-2002-GodardM #product line
- A Characterization of Families of Graphs in Which Election Is Possible (EG, YM), pp. 159–172.
- FoSSaCS-2002-Mossakowski #development
- Heterogeneous Development Graphs and Heterogeneous Borrowing (TM), pp. 326–341.
- STOC-2002-AchlioptasM
- Almost all graphs with average degree 4 are 3-colorable (DA, CM), pp. 199–208.
- STOC-2002-ArgeBDHM #algorithm #queue
- Cache-oblivious priority queue and graph algorithm applications (LA, MAB, EDD, BHM, JIM), pp. 268–276.
- STOC-2002-CooperF #crawling #web
- Crawling on web graphs (CC, AMF), pp. 419–427.
- STOC-2002-KargerL #random
- Random sampling in residual graphs (DRK, MSL), pp. 63–66.
- STOC-2002-Molloy
- The Glauber dynamics on colourings of a graph with high girth and maximum degree (MM), pp. 91–98.
- STOC-2002-SchaeferSS #string
- Recognizing string graphs in NP (MS, ES, DS), pp. 1–6.
- LICS-2002-HylandS #game studies
- Games on Graphs and Sequentially Realizable Functionals (MH, AS), pp. 257–264.
- ICDAR-2001-BagdanovW #classification #documentation #fine-grained #first-order #random #using
- Fine-Grained Document Genre Classification Using First Order Random Graphs (ADB, MW), pp. 79–85.
- ICDAR-2001-ElgammalI #framework #recognition #segmentation
- A Graph-Based Segmentation and Feature-Extraction Framework for Arabic Text Recognition (AME, MAI), pp. 622–626.
- ICDAR-2001-LoprestiW #analysis #documentation
- Evaluating Document Analysis Results via Graph Probing (DPL, GTW), pp. 116–120.
- ICDAR-2001-XueG #feature model #image
- Building Skeletal Graphs for Structural Feature Extraction on Handwriting Images (HX, VG), pp. 96–100.
- ITiCSE-2001-KhuriH #algorithm #education #named
- EVEGA: an educational visulalization environment for graph algorithms (SK, KH), pp. 101–104.
- CSMR-2001-MorettiCO #algorithm #control flow
- New Algorithms for Control-Flow Graph Structuring (EM, GC, AO), pp. 184–187.
- ICSM-2001-ByersKP #dependence
- Syntax-Directed Construction of Value Dependence Graphs (DB, MK, TP), p. 692–?.
- ICSM-2001-SartipiK #approach #architecture #pattern matching
- A Graph Pattern Matching Approach to Software Architecture Recovery (KS, KK), p. 408–?.
- ICSM-2001-SouterP #incremental #maintenance #object-oriented
- Incremental Call Graph Reanalysis for Object-Oriented Software Maintenance (ALS, LLP), pp. 682–691.
- IWPC-2001-LangeWS #comprehension #relational #tool support
- Comparing Graph-Based Program Comprehension Tools to Relational Database-Based Tools (CL, AW, HMS), pp. 209–218.
- WCRE-2001-Balmas #approach #dependence #game studies
- Displaying Dependence Graphs: A Hierarchical Approach (FB), pp. 261–270.
- WCRE-2001-GannodG #dependence
- An Investigation into the Connectivity Properties of Source-Header Dependency Graphs (GCG, BDG), pp. 115–126.
- WCRE-2001-Krinke #dependence #identification
- Identifying Similar Code with Program Dependence Graphs (JK), pp. 301–309.
- ICALP-2001-AlberFN #complexity #exponential #problem
- Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems (JA, HF, RN), pp. 261–272.
- ICALP-2001-AlurEY #verification
- Realizability and Verification of MSC Graphs (RA, KE, MY), pp. 797–808.
- ICALP-2001-ChakrabartiK #bound #complexity #random
- Improved Lower Bounds on the Randomized Complexity of Graph Properties (AC, SK), pp. 285–296.
- ICALP-2001-IsobeZN
- Total Colorings of Degenerated Graphs (SI, XZ, TN), pp. 506–517.
- ICALP-2001-Madhusudan #behaviour #branch #reasoning #sequence
- Reasoning about Sequential and Branching Behaviours of Message Sequence Graphs (PM), pp. 809–820.
- ICALP-2001-MargaraS #decidability #network
- Decidable Properties of Graphs of All-Optical Networks (LM, JS), pp. 518–529.
- ICALP-2001-Thorup
- Quick k-Median, k-Center, and Facility Location for Sparse Graphs (MT), pp. 249–260.
- GT-VMT-2001-BauderonGMMS #algorithm #distributed #visualisation
- Visualization of Distributed Algorithms Based on Graph Relabelling Systems (MB, SG, YM, MM, AS), pp. 227–237.
- GT-VMT-2001-Pfaltz #approach #concept #empirical #induction
- Transformations of Concept Graphs: An Approach to Empirical Induction (JLP), pp. 318–324.
- CHI-2001-CardPWMRSB #analysis #behaviour #protocol #usability #web
- Information scent as a driver of Web behavior graphs: results of a protocol analysis method for Web usability (SKC, PP, MMVDW, JBM, RWR, PKS, JB), pp. 498–505.
- SVIS-2001-Evstiougov-Babaev #control flow #developer #embedded #visualisation
- Call Graph and Control Flow Graph Visualization for Developers of Embedded Applications (AAEB), pp. 337–346.
- SVIS-2001-GutwengerJKLM #algorithm
- Graph Drawing Algorithm Engineering with AGD (CG, MJ, GWK, SL, PM), pp. 307–323.
- SVIS-2001-MutzelE #visualisation
- Graphs in Software Visualization — Introduction (PM, PE), pp. 285–294.
- SVIS-2001-WinterKR #overview
- An Overview of the GXL Graph Exchange Language (AW, BK, VR), pp. 324–336.
- SVIS-2001-ZimmermannZ #memory management #visualisation
- Visualizing Memory Graphs (TZ, AZ), pp. 191–204.
- CIKM-2001-ZhaHDGS #clustering
- Bipartite Graph Partitioning and Data Clustering (HZ, XH, CHQD, MG, HDS), pp. 25–32.
- ICML-2001-BlumC #learning #using
- Learning from Labeled and Unlabeled Data using Graph Mincuts (AB, SC), pp. 19–26.
- KDD-2001-Dhillon #clustering #documentation #using #word
- Co-clustering documents and words using bipartite spectral graph partitioning (ISD), pp. 269–274.
- KDD-2001-DingHZ #component #web
- A spectral method to separate disconnected and nearly-disconnected web graph components (CHQD, XH, HZ), pp. 275–280.
- KDD-2001-ShekharLZ #algorithm #detection #summary
- Detecting graph-based spatial outliers: algorithms and applications (a summary of results) (SS, CTL, PZ), pp. 371–376.
UML-2001-EshuisW #algorithm #execution #process #uml- An Execution Algorithm for UML Activity Graphs (RE, RW), pp. 47–61.
RE-2001-DelugachL #concept #requirements- Acquiring Software Requirements As Conceptual Graphs (HSD, BEL), pp. 296–297.
- ASE-2001-ArdourelH #encapsulation #tool support
- AGATE, Access Graph-Based Tools for Handling Encapsulation (GA, MH), pp. 311–314.
- ESEC-FSE-2001-WermelingerLF #architecture
- A graph based architectural (Re)configuration language (MW, AL, JLF), pp. 21–32.
- ICSE-2001-DillonS #analysis #specification #using
- Leightweight Analysis of Operational Specifications Using Inference Graphs (LKD, KS), pp. 57–67.
- SAC-2001-Comai #experience #query #user interface #xml
- Graph-based GUIs for querying XML data: the XML-GL experience (SC), pp. 269–274.
- SAC-2001-DowellB #mobile #monte carlo #network #random #simulation #validation
- Connectivity of random graphs and mobile networks: validation of Monte Carlo simulation results (LJD, MLB), pp. 77–81.
- SAC-2001-JulstromR #algorithm #problem
- Weight-biased edge-crossover in evolutionary algorithms for wto graph problems (BAJ, GRR), pp. 321–326.
- DAC-2001-LinC #named #representation #transitive
- TCG: A Transitive Closure Graph-Based Representation for Non-Slicing Floorplans (JML, YWC), pp. 764–769.
- DAC-2001-WolfeWP #clustering
- Watermarking Graph Partitioning Solutions (GW, JLW, MP), pp. 486–489.
- DATE-2001-CasavantGLMWA #generative #simulation
- Property-specific witness graph generation for guided simulation (AEC, AG, SL, AM, KW, PA), p. 799.
- DATE-2001-GaoW #algorithm #modelling
- A graph based algorithm for optimal buffer insertion under accurate delay models (YG, DFW), pp. 535–539.
- DATE-2001-PasseroneWL #generative #scheduling
- Generation of minimal size code for scheduling graphs (CP, YW, LL), pp. 668–673.
- DATE-2001-XieW #hardware #scheduling
- Allocation and scheduling of conditional task graph in hardware/software co-synthesis (YX, WW), pp. 620–625.
- HPCA-2001-AnnavaramPD #database
- Call Graph Prefetching for Database Applications (MA, JMP, ESD), pp. 281–290.
- FASE-2001-MossakowskiAH #development
- Extending Development Graphs with Hiding (TM, SA, DH), pp. 269–283.
- FoSSaCS-2001-Bojanczyk #automaton #finite #problem
- The Finite Graph Problem for Two-Way Alternating Automata (MB), pp. 88–103.
- FoSSaCS-2001-KochMP #approach #data access #policy #specification
- Foundations for a Graph-Based Approach to the Specification of Access Control Policies (MK, LVM, FPP), pp. 287–302.
- STOC-2001-AmbainisKV #quantum
- Quantum walks on graphs (DA, AA, JK, UVV), pp. 50–59.
- STOC-2001-ElkinP
- (1+ε,β)-Spanner Constructions for General Graphs (ME, DP), pp. 173–182.
- STOC-2001-Kosaraju #parallel
- Euler paths in series parallel graphs (SRK), pp. 237–240.
- STOC-2001-MolloyR
- Colouring graphs when the number of colours is nearly the maximum degree (MM, BAR), pp. 462–470.
- STOC-2001-SchaeferS #decidability #string
- Decidability of string graphs (MS, DS), pp. 241–246.
- IJCAR-2001-Benedetti
- Conditional Pure Literal Graphs (MB), pp. 331–346.
- IJCAR-2001-HahnleMR #order
- Ordered Resolution vs. Connection Graph Resolution (RH, NVM, ER), pp. 182–194.
- IJCAR-2001-Jones #analysis #termination
- Program Termination Analysis by Size-Change Graphs (NDJ), pp. 1–4.
- IJCAR-2001-Middeldorp #approximate #automaton #dependence #using
- Approximating Dependency Graphs Using Tree Automata Techniques (AM), pp. 593–610.
- SAT-2001-RanderathSBHKMSC #problem #satisfiability
- A Satisfiability Formulation of Problems on Level Graphs (BR, ES, EB, PLH, AK, KM, BS, OC), pp. 269–277.
- PODS-2000-KumarRRSTU #web
- The Web as a Graph (RK, PR, SR, DS, AT, EU), pp. 1–10.
- VLDB-2000-DiligentiCLGG #crawling #using
- Focused Crawling Using Context Graphs (MD, FC, SL, CLG, MG), pp. 527–534.
- IWPC-2000-Anquetil #comparison #concept #reverse engineering
- A Comparison of Graphs of Concept for Reverse Engineering (NA), pp. 231–240.
- IWPC-2000-ChenR #case study #dependence #feature model #using
- Case Study of Feature Location Using Dependence Graph (KC, VR), pp. 241–247.
- IWPC-2000-RaysideRHK #algorithm #automation #clustering #object-oriented #source code
- The Effect of Call Graph Construction Algorithms for Object-Oriented Programs on Automatic Clustering (DR, SR, EH, KK), pp. 191–200.
- ICALP-2000-BenderR #sublinear #testing
- Testing Acyclicity of Directed Graphs in Sublinear Time (MAB, DR), pp. 809–820.
- ICALP-2000-Djidjev
- Computing the Girth of a Planar Graph (HD), pp. 821–831.
- ICALP-2000-Grigni #approximate
- Approximate TSP in Graphs with Forbidden Minors (MG), pp. 869–877.
- ICALP-2000-HenriksenMKT #on the #sequence
- On Message Sequence Graphs and Finitely Generated Regular MSC Languages (JGH, MM, KNK, PST), pp. 675–686.
- ICALP-2000-Mehlhorn #algorithm #constraints #programming
- Constraint Programming and Graph Algorithms (KM), pp. 571–575.
IFM-2000-BoltonD #process- Activity Graphs and Processes (CB, JD), pp. 77–96.
- ICPR-v1-2000-KangCM #2d
- A Graph-Based Global Registration for 2D Mosaics (EYEK, IC, GGM), pp. 1257–1260.
- ICPR-v2-2000-BartoliPSZ #morphism #using
- Attributed Tree Homomorphism Using Association Graphs (MB, MP, KS, SWZ), pp. 2133–2136.
- ICPR-v2-2000-Bunke
- Recent Developments in Graph Matching (HB), pp. 2117–2124.
- ICPR-v2-2000-CordellaFSV #component #detection #image #performance
- Fast Graph Matching for Detecting CAD Image Components (LPC, PF, CS, MV), pp. 6034–6037.
- ICPR-v2-2000-KimK #estimation #parametricity #random #recognition
- Minimum Entropy Estimation of Hierarchical Random Graph Parameters for Character Recognition (HYK, JHK), pp. 6050–6053.
- ICPR-v2-2000-LuoH #algorithm #composition #using
- Symbolic Graph Matching Using the EM Algorithm and Singular Value Decomposition (BL, ERH), pp. 2141–2144.
- ICPR-v2-2000-PerchantB #fuzzy #morphism
- Graph Fuzzy Homomorphism Interpreted as Fuzzy Association Graphs (AP, IB), pp. 6042–6045.
- ICPR-v2-2000-SanfeliuAS #clustering #synthesis
- Clustering of Attributed Graphs and Unsupervised Synthesis of Function-Described Graphs (AS, RA, FS), pp. 6022–6025.
- ICPR-v2-2000-SerratosaAS #algorithm #performance
- Efficient Algorithms for Matching Attributed Graphs and Function-Described Graphs (FS, RA, AS), pp. 2867–2872.
- ICPR-v3-2000-GrigorescuP
- Graph-Based Features for Texture Discrimination (CG, NP), pp. 7088–7091.
- ICPR-v3-2000-Verges-LlahiSC #algorithm #clustering #constraints #image #segmentation
- Color Image Segmentation Solving Hard-Constraints on Graph Partitioning Greedy Algorithms (JVL, AS, JC), pp. 3629–3632.
- ICPR-v4-2000-Lucas #performance #taxonomy
- Efficient Best-First Dictionary Search Given Graph-Based Input (SML), pp. 4434–4437.
- OOPSLA-2000-TipP #algorithm #scalability
- Scalable propagation-based call graph construction algorithms (FT, JP), pp. 281–293.
- TOOLS-ASIA-2000-LiuJC #approach
- A Graph-Theoretic Approach for Recognizing the User Interpretation without Conflicts (GL, WJ, ZC), pp. 291–298.
- POPL-2000-EsparzaP #algorithm #interprocedural #parallel #performance
- Efficient Algorithms for pre* and post* on Interprocedural Parallel Flow Graphs (JE, AP), pp. 1–11.
- POPL-2000-SuFA #constraints
- Projection Merging: Reducing Redundancies in Inclusion Constraint Graphs (ZS, MF, AA), pp. 81–95.
- SAC-2000-ColeZ #coordination #independence #process
- Activity Graphs: A Model-Independent Intermediate Layer for Skeletal Coordination (MC, AZ), pp. 255–261.
- SAC-2000-KhuriWS #algorithm #search-based
- A Grouping Genetic Algorithm for Coloring the Edges of Graphs (SK, TW, YS), pp. 422–427.
- SAC-2000-LeeKHL #dependence #scheduling #using
- Task Scheduling using a Block Dependency DAG for Block-Oriented Sparse Cholesky Factorization (HL, JK, SJH, SL), pp. 641–648.
- CC-2000-Agrawal
- Demand-Driven Construction of Call Graphs (GA), pp. 125–140.
- CC-2000-KnoopR #constant
- Constant Propagation on the Value Graph: Simple Constants and Beyond (JK, OR), pp. 94–109.
- DAC-2000-BlaauwPD
- Removing user specified false paths from timing graphs (DB, RP, AD), pp. 270–273.
- DAC-2000-HorstmannshoffM #code generation #data flow #performance
- Efficient building block based RTL code generation from synchronous data flow graphs (JH, HM), pp. 552–555.
- DAC-2000-JainMMWL #analysis #canonical #complexity #composition #how
- Analysis of composition complexity and how to obtain smaller canonical graphs (JJ, KM, DM, IW, YL), pp. 681–686.
- DATE-2000-KruseSJSN #bound #constraints #data flow #power management
- Lower Bounds on the Power Consumption in Scheduled Data Flow Graphs with Resource Constraints (LK, ES, GJ, AS, WN), p. 737.
- PDP-2000-KozirisRTP #algorithm #architecture #clustering #multi #performance #physics
- An efficient algorithm for the physical mapping of clustered task graphs onto multiprocessor architectures (NK, MR, PT, GKP), pp. 406–413.
- FoSSaCS-2000-Morvan #on the
- On Rational Graphs (CM), pp. 252–266.
- STOC-2000-AielloCL #random
- A random graph model for massive graphs (WA, FRKC, LL), pp. 171–180.
- STOC-2000-ChenX #query
- Shortest path queries in planar graphs (DZC, JX), pp. 469–478.
- STOC-2000-EvenGS #approximate
- Improved approximations of crossings in graph drawings (GE, SG, BS), pp. 296–305.
- STOC-2000-FederMS
- Finding long paths and cycles in sparse Hamiltonian graphs (TF, RM, CSS), pp. 524–529.
- STOC-2000-Grohe #morphism #testing
- Isomorphism testing for embeddable graphs through definability (MG), pp. 63–72.
- STOC-2000-MahajanV
- A new NC-algorithm for finding a perfect matching in bipartite planar and small genus graphs (MM, KRV), pp. 351–357.
- STOC-2000-Thorup
- Near-optimal fully-dynamic graph connectivity (MT), pp. 343–350.
- CSL-2000-MakowskyM #combinator #complexity #generative #on the
- On the Complexity of Combinatorial and Metafinite Generating Functions of Graph Properties in the Computational Model of Blum, Shub and Smale (JAM, KM), pp. 399–410.
- CSL-2000-Vardi #automation #automaton #logic #verification
- Automated Verification = Graphs, Automata, and Logic (MYV), p. 139.
- ICDAR-1999-ChenMM #algorithm #performance #segmentation
- An Efficient Algorithm for Matching a Lexicon with a Segmentation Graph (DYC, JM, KMM), pp. 543–546.
- CSMR-1999-AntoniolCT #pointer
- Impact of Function Pointers on the Call Graph (GA, FC, PT), pp. 51–61.
- ICSM-1999-Agrawal #analysis #data flow
- Simultaneous Demand-Driven Data-Flow and Call Graph Analysis (GA), pp. 453–462.
- PASTE-1999-Agrawal #performance #testing #using
- Efficient Coverage Testing Using Global Dominator Graphs (HA), pp. 11–20.
- ICALP-1999-DodisK #trade-off
- Space Time Tradeoffs for Graph Properties (YD, SK), pp. 291–300.
- ICALP-1999-FlescaG #order #query #regular expression
- Partially Ordered Regular Languages for Graph Queries (SF, SG), pp. 321–330.
- ICALP-1999-FrickG #first-order
- Deciding First-Order Properties of Locally Tree-Decomposalbe Graphs (MF, MG), pp. 331–340.
- ICALP-1999-GavoilleH #bound
- Compact Routing Tables for Graphs of Bounded Genus (CG, NH), pp. 351–360.
- WIA-1999-GiammarresiPW
- Thompson Digraphs: A Characterization (DG, JLP, DW), pp. 91–100.
- RTA-1999-Courcelle #logic
- Hierarchical Graph Decompositions Defined by Grammars and Logical Formulas (BC), pp. 90–91.
- AGTIVE-1999-Cremer #re-engineering #reverse engineering #tool support
- Graph-Based Reverse Engineering and Reengineering Tools (KC), pp. 95–109.
- AGTIVE-1999-EnglertK #image
- Image Structure from Monotonic Dual Graph Contraction (RE, WGK), pp. 297–308.
- AGTIVE-1999-FischerKB #fuzzy #learning
- Learning and Rewriting in Fuzzy Rule Graphs (IF, MK, MRB), pp. 263–270.
- AGTIVE-1999-Jager #framework #named #visual notation
- UPGRADE — A Framework for Graph-Based Visual Applications (DJ), pp. 427–432.
- AGTIVE-1999-JagerSW #development #modelling #named #process
- AHEAD: A Graph-Based System for Modeling and Managing Development Processes (DJ, AS, BW), pp. 325–339.
- AGTIVE-1999-RodgersV #algorithm #animation
- Graph Algorithm Animation with Grrr (PJR, NV), pp. 379–393.
- AGTIVE-1999-SzubaGB #visualisation
- Graph Visualization in ArchiCAD (JS, EG, AB), pp. 241–246.
- CAiSE-1999-SadiqO #identification #modelling #process #reduction
- Applying Graph Reduction Techniques for Identifying Structural Conflicts in Process Models (WS, MEO), pp. 195–209.
- CIKM-1999-RadevPMP #approach #behaviour #multi #object-oriented #representation
- Graph-Based Object-Oriented Approach for Structural and Behavioral Representation of Multimedia Data (IR, NP, KM, EKP), pp. 522–530.
- KDD-1999-AggarwalWWY #approach #collaboration
- Horting Hatches an Egg: A New Graph-Theoretic Approach to Collaborative Filtering (CCA, JLW, KLW, PSY), pp. 201–212.
- OOPSLA-1999-LeeSL #component #library
- The Generic Graph Component Library (LQL, JGS, AL), pp. 399–414.
- TOOLS-ASIA-1999-ShenLG #network #object-oriented
- An Object-Oriented Net Graph Model for Agent Group-Based Network Management (JS, JL, GG), pp. 126–132.
- TOOLS-ASIA-1999-ShenLSZ #algorithm #architecture #object-oriented #using
- An Algorithm for Describing Object-Oriented Software Architecture Using Graph (HHS, CL, MMS, WMZ), pp. 225–231.
- PLDI-1999-Vegdahl #using
- Using Node Merging to Enhance Graph Coloring (SRV), pp. 150–154.
- POPL-1999-Ertl
- Optimal Code Selection in DAGs (MAE), pp. 242–249.
- SAS-1999-Mauborgne
- Binary Decision Graphs (LM), pp. 101–116.
- SAS-1999-TakimotoH #using
- Partial Dead Code Elimination Using Extended Value Graph (MT, KH), pp. 179–193.
- ICSE-1999-MaruyamaS #automation #dependence #refactoring #using
- Automatic Method Refactoring Using Weighted Dependence Graphs (KM, KS), pp. 236–245.
- SAC-1999-Binkley #dependence #slicing #using
- Computing Amorphous Program Slices Using Dependence Graphs (DB), pp. 519–525.
- DAC-1999-Bergamaschi #behaviour #logic #network #synthesis
- Behavioral Network Graph: Unifying the Domains of High-Level and Logic Synthesis (RAB), pp. 213–218.
- DAC-1999-PerkowskiMGBM #algorithm #evaluation #performance
- Graph Coloring Algorithms for Fast Evaluation of Curtis Decompositions (MAP, RM, SG, MB, AM), pp. 225–230.
- DATE-1999-Kuchcinski #constraints #finite #scheduling #using
- Integrated Resource Assignment and Scheduling of Task Graphs Using Finite Domain Constraints (KK), pp. 772–773.
- STOC-1999-CapalboK
- Small Universal Graphs (MRC, SRK), pp. 741–749.
- STOC-1999-FederHKM #complexity #problem
- Complexity of Graph Partition Problems (TF, PH, SK, RM), pp. 464–472.
- STOC-1999-KlivansM #morphism #polynomial #proving
- Graph Nonisomorphism has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses (AK, DvM), pp. 659–667.
- STOC-1999-Schaefer #polynomial
- Graph Ramsey Theory and the Polynomial Hierarchy (MS), pp. 592–601.
- ICLP-1999-Muller #constraints
- Practical Investigation of Constraints with Graph Views (TM), p. 615.
ADL-1998-OhsawaBY #automation #named- KeyGraph: Automatic Indexing by Co-Occurrence Graph Based on Building Construction Metaphor (YO, NEB, MY), pp. 12–18.
- ITiCSE-1998-DagdilelisS #algorithm #education #named
- DIDAGRAPH: software for teaching graph theory algorithms (VD, MS), pp. 64–68.
- ICSM-1998-LiangH #dependence #slicing #using
- Slicing Objects Using System Dependence Graphs (DL, MJH), pp. 358–367.
- WCRE-1998-ValasareddiC #identification #process #source code
- A Graph-Based Object Identification Process for Procedural Programs (RRV, DLC), pp. 50–58.
- ICALP-1998-BaldanCM #process
- Concatenable Graph Processes: Relating Processes and Derivation Traces (PB, AC, UM), pp. 283–295.
- ICALP-1998-ChuangGHKL #canonical #encoding #multi #order
- Compact Encodings of Planar Graphs via Canonical Orderings and Multiple Parentheses (RCNC, AG, XH, MYK, HIL), pp. 118–129.
- WIA-1998-Velinov #implementation #on the #semantics #syntax
- On the Syntax, Semantics, and Implementation of a Graph-Based Computational Environment (YV), pp. 199–212.
- TAGT-1998-EhrenfeuchtHHR #complexity
- Complexity Issues in Switching of Graphs (AE, JH, TH, GR), pp. 59–70.
- TAGT-1998-EhrigHLOPR #framework #rule-based
- Double-Pullback Graph Transitions: A Rule-Based Framework with Incomplete Information (HE, RH, ML, FO, JP, GR), pp. 85–102.
- TAGT-1998-GodardMM #power of
- The Power of Local Computations in Graphs with Initial Knowledge (EG, YM, AM), pp. 71–84.
- TAGT-1998-KrappKSW #development #modelling #process
- Graph-Based Models for Managing Development Processes, Resources, and Products (CAK, SK, AS, BW), pp. 455–474.
- TAGT-1998-Rudolf #constraints #pattern matching #performance
- Utilizing Constraint Satisfaction Techniques for Efficient Graph Pattern Matching (MR), pp. 238–251.
- CHI-1998-TerveenH #visualisation
- Finding and Visualizing Inter-Site Clan Graphs (LGT, WCH), pp. 448–455.
- ACIR-1998-OunisP #concept #effectiveness #performance #query #relational #using
- Effective and Efficient Relational Query Processing Using Conceptual Graphs (IO, MP).
- ICML-1998-LiquiereS #machine learning
- Structural Machine Learning with Galois Lattice and Graphs (ML, JS), pp. 305–313.
- ICPR-1998-CordellaFSTV #algorithm #evaluation #performance
- Graph matching: a fast algorithm and its evaluation (LPC, PF, CS, FT, MV), pp. 1582–1584.
- ICPR-1998-FrydendalJ #image #segmentation #using
- Segmentation of sugar beets using image and graph processing (IF, RJ), pp. 1697–1699.
- ICPR-1998-KangOC #3d #using
- Character grouping technique using 3D neighborhood graphs in raster map (YBK, SYO, HGC), pp. 1092–1094.
- ICPR-1998-Kofler
- A topological net structure and a topological graph (HK), pp. 1449–1454.
- ICPR-1998-MoriKTS #using #visualisation
- Visualization of the structure of classes using a graph (YM, MK, JT, MS), pp. 1724–1727.
- ICPR-1998-Rizzi #approach #clustering #search-based
- A genetic approach to hierarchical clustering of Euclidean graphs (SR), pp. 1543–1545.
- ICPR-1998-YamaguchiKI #parametricity #relational #using
- Stereo matching for stone statues using SRI parameters and relational graph (AY, KK, SI), pp. 785–787.
- KR-1998-CheinMS #information management #representation #semantics
- Nested Graphs: A Graph-based Knowledge Representation Model with FOL Semantics (MC, MLM, GS), pp. 524–535.
- PLDI-1998-FahndrichFSA #constraints #online
- Partial Online Cycle Elimination in Inclusion Constraint Graphs (MF, JSF, ZS, AA), pp. 85–96.
- SAC-1998-AhmedDR #fuzzy #memory management #performance #reuse #using
- Fast recall of reusable fuzzy plans using acyclic directed graph memory (MA, ED, DCR), pp. 272–276.
- CC-1998-CooperS
- Live Range Splitting in a Graph Coloring Register Allocator (KDC, LTS), pp. 174–187.
- CC-1998-KnoopKS #question
- Basic-Block Graphs: Living Dinosaurs? (JK, DK, BS), pp. 65–79.
- DAC-1998-KirovskiP #performance #scalability
- Efficient Coloring of a Large Spectrum of Graphs (DK, MP), pp. 427–432.
- DAC-1998-KukimotoBS
- Delay-Optimal Technology Mapping by DAG Covering (YK, RKB, PS), pp. 348–351.
- DAC-1998-OhH #data flow #design
- Rate Optimal VLSI Design from Data Flow Graph (MO, SH), pp. 118–121.
- DATE-1998-ElesKPDP #embedded #process #scheduling #synthesis
- Scheduling of Conditional Process Graphs for the Synthesis of Embedded Systems (PE, KK, ZP, AD, PP), pp. 132–138.
- DATE-1998-Hetzel #grid
- A Sequential Detailed Router for Huge Grid Graphs (AH), pp. 332–338.
- PDP-1998-BeckZU #architecture #clustering #dependence
- Architecture-dependent partitioning of dependence graphs (MB, EZ, TU), pp. 70–76.
- PDP-1998-ChanL #scheduling
- Scheduling tasks in DAG to heterogeneous processor system (WYC, CKL), pp. 27–31.
- FoSSaCS-1998-BottreauM #normalisation
- Minor Searching, Normal Forms of Graph Relabelling: Two Applications Based on Enumerations by Graph Relabelling (AB, YM), pp. 110–124.
- STOC-1998-BenderFRSV #power of
- The Power of a Pebble: Exploring and Mapping Directed Graphs (MAB, AF, DR, AS, SPV), pp. 269–278.
- STOC-1998-ChenGP
- Planar Map Graphs (ZZC, MG, CHP), pp. 514–523.
- STOC-1998-GoldreichR #sublinear
- A Sublinear Bipartiteness Tester for Bunded Degree Graphs (OG, DR), pp. 289–298.
- STOC-1998-KargerL
- Finding Maximum Flows in Undirected Graphs Seems Easier than Bipartite Matching (DRK, MSL), pp. 69–78.
- STOC-1998-LubyMSS #analysis #design #using
- Analysis of Low Density Codes and Improved Designs Using Irregular Graphs (ML, MM, MAS, DAS), pp. 249–258.
- STOC-1998-PeinadoL #embedded #generative #random
- Random Generation of Embedded Graphs and an Extension to Dobrushin Uniqueness (MP, TL), pp. 176–185.
- STOC-1998-RaoS #approximate #geometry
- Approximating Geometrical Graphs via “Spanners” and “Banyans” (SR, WDS), pp. 540–550.
- CAV-1998-XuCSCM #first-order #logic #model checking #multi #using
- Model Checking for a First-Order Temporal Logic Using Multiway Decision Graphs (YX, EC, XS, FC, OAM), pp. 219–231.
- CSL-1998-KreidlerS #monad
- Monadic NP and Graph Minors (MK, DS), pp. 126–141.
- LICS-1998-Grohe #fixpoint #logic
- Fixed-Point Logics on Planar Graphs (MG), pp. 6–15.
- ICDAR-1997-LiOHG #component #relational
- Recognizing components of handwritten characters by attributed relational graphs with stable features (XL, WGO, JH, WG), pp. 616–620.
- ICALP-1997-AspertiL #on the
- On the Dynamics of Sharing Graphs (AA, CL), pp. 259–269.
- ICALP-1997-Bar-NoyK
- The Minimum Color Sum of Bipartite Graphs (ABN, GK), pp. 738–748.
- ICALP-1997-BroersmaKKM #independence #set
- Independent Sets in Asteroidal Triple-Free Graphs (HB, TK, DK, HM), pp. 760–770.
- ICALP-1997-CaceresDFFRRSS #algorithm #parallel #performance
- Efficient Parallel Graph Algorithms For Coarse Grained Multicomputers and BSP (EC, FKHAD, AF, PF, IR, AR, NS, SWS), pp. 390–400.
- ICALP-1997-Hagerup #algorithm #bound
- Dynamic Algorithms for Graphs of Bounded Treewidth (TH), pp. 292–302.
- ICALP-1997-HenzingerK #maintenance
- Maintaining Minimum Spanning Trees in Dynamic Graphs (MRH, VK), pp. 594–604.
- RTA-1997-Lynch #using
- Goal-Directed Completion Using SOUR Graphs (CL), pp. 8–22.
- ICFP-1997-Claessen #compilation
- Graphs in Compilation (KC), p. 309.
- ICFP-1997-Erwig #functional #programming
- Functional Programming with Graphs (ME), pp. 52–65.
- ICFP-1997-LawallM #on the #reduction
- On Global Dynamics of Optimal Graph Reduction (JLL, HGM), pp. 188–195.
- IFL-1997-Erwig #persistent #question
- Fully Persistent Graphs — Which One To Choose? (ME), pp. 123–140.
- GG-Handbook-Vol1-EhrenfeuchtHR #composition #framework #named
- 2-Structures — A Framework For Decomposition And Transformation Of Graphs (AE, TH, GR), pp. 401–478.
- HCI-SEC-1997-Yoshida #induction #modelling
- User Modeling by Graph-Based Induction (KY), pp. 23–26.
- OOPSLA-1997-GroveDDC #object-oriented
- Call Graph Construction in Object-Oriented Languages (DG, GD, JD, CC), pp. 108–124.
- TOOLS-ASIA-1997-ChenWC #dependence #object-oriented #slicing
- An Object-Oriented Dependency Graph for Program Slicing (JLC, FJW, YLC), pp. 121–130.
- TOOLS-ASIA-1997-WuW #algebra #database #object-oriented
- Directed Graph Based Association Algebra for Object-Oriented Databases (SW, NW), pp. 53–59.
- PLILP-1997-Mossin #higher-order
- Higher-Order Value Flow Graphs (CM), pp. 159–173.
- DAC-1997-AdeLP #data flow #memory management
- Data Memory Minimisation for Synchronous Data Flow Graphs Emulated on DSP-FPGA Targets (MA, RL, JAP), pp. 64–69.
- DAC-1997-Coudert
- Exact Coloring of Real-Life Graphs is Easy (OC), pp. 121–126.
- DAC-1997-YeR #algorithm #network #synthesis
- A Graph-Based Synthesis Algorithm for AND/XOR Networks (YY, KR), pp. 107–112.
- EDTC-1997-BensoPRRU #approach #fault #low level
- A new approach to build a low-level malicious fault list starting from high-level description and alternative graphs (AB, PP, MR, MSR, RU), pp. 560–565.
- EDTC-1997-ChiusanoCPR #hybrid #problem
- Hybrid symbolic-explicit techniques for the graph coloring problem (SC, FC, PP, MSR), pp. 422–426.
- EDTC-1997-Coudert #optimisation #problem
- Solving graph optimization problems with ZBDDs (OC), pp. 224–228.
- EDTC-1997-LiuS #heuristic #multi #performance #using
- Multi-layer chip-level global routing using an efficient graph-based Steiner tree heuristic (LCEL, CS), pp. 311–318.
- EDTC-1997-ThoenSJGM #embedded #multi #realtime #synthesis #thread
- Multi-thread graph: a system model for real-time embedded software synthesis (FT, JVDS, GGdJ, GG, HDM), pp. 476–481.
- PDP-1997-IsmailC #approach #execution #multi #scheduling
- A greedy approach for scheduling directed cyclic weighted task graphs on multiprocessors running under the macrodataflow model of execution (MAI, TC), pp. 47–53.
- STOC-1997-BroderFU #approach #random
- Static and Dynamic Path Selection on Expander Graphs: A Random Walk Approach (AZB, AMF, EU), pp. 531–539.
- STOC-1997-ChungY
- Eigenvalues, Flows and Separators of Graphs (FRKC, STY), p. 749.
- STOC-1997-GoldreichR #bound #testing
- Property Testing in Bounded Degree Graphs (OG, DR), pp. 406–415.
- STOC-1997-He #on the
- On Floorplans of Planar Graphs (XH), pp. 426–435.
- STOC-1997-Karger #random #using
- Using Random Sampling to Find Maximum Flows in Uncapacitated Undirected Graphs (DRK), pp. 240–249.
- TACAS-1997-BeeckBCDFKMSS #morphism #polymorphism #power of
- Graphs in METAFrame: The Unifying Power of Polymorphism (MvdB, VB, AC, AD, CF, DK, TMS, FS, BS), pp. 112–129.
TAPSOFT-1997-IlieA #model checking #reachability- Model Checking Through Symbolic Reachability Graph (JMI, KA), pp. 213–224.
- TAPSOFT-1997-KovacL
- Maximum Packing for Biconnected Outerplanar Graphs (TK, AL), pp. 393–404.
- CAV-1997-GrafS
- Construction of Abstract State Graphs with PVS (SG, HS), pp. 72–83.
- CSL-1997-Schiering #approach #higher-order #logic #monad
- A Hierarchical Approach to Monadic Second-Order Logic over Graphs (IS), pp. 424–440.
- ILPS-1997-Reps #program analysis #reachability
- Program Analysis via Graph Reachability (TWR), pp. 5–19.
- LICS-1997-MatzT #infinity #monad #quantifier
- The Monadic Quantifier Alternation Hierarchy over Graphs is Infinite (OM, WT), pp. 236–244.
- ICSM-1996-MancoridisH #clustering #using
- Recovering the Structure of Software Systems Using Tube Graph Interconnection Clustering (SM, RCH), p. 23–?.
- ICALP-1996-Caucal #decidability #infinity #monad #on the
- On Infinite Transition Graphs Having a Decidable Monadic Theory (DC), pp. 194–205.
- ICALP-1996-Chen #approximate #problem
- Practical Approximation Schemes for Maximum Induced-Subgraph Problems on K_{3, 3}-free or K_5-free Graphs (ZZC), pp. 268–279.
- ICALP-1996-HenzingerT #algorithm
- Improved Sampling with Applications to Dynamic Graph Algorithms (MRH, MT), pp. 290–299.
- ICALP-1996-KloksKW
- Minimum Fill-In on Circle and Circular-Arc Graphs (TK, DK, CKW), pp. 256–267.
- ICALP-1996-KoutsoupiasPY
- Searching a Fixed Graph (EK, CHP, MY), pp. 280–289.
- ICALP-1996-Senizergues
- Semi-Groups Acting on Context-Free Graphs (GS), pp. 206–218.
- IFL-1996-LoidlH #communication #effectiveness #parallel #reduction
- Making a Packet: Cost-Effective Communication for a Parallel Graph Reducer (HWL, KH), pp. 184–199.
- CIKM-1996-HuangJR #clustering #database #effectiveness #query
- Effective Graph Clustering for Path Queries in Digital Map Databases (YWH, NJ, EAR), pp. 215–222.
- CIKM-1996-Pulido #query #recursion #traversal #using
- Recursive Query Processing Using Graph Traversal Techniques (EP), pp. 37–44.
- ICPR-1996-Benois-PineauKB #optimisation #problem
- Coding of structure in the region-based coder as a problem of optimization on graphs (JBP, AK, DB), pp. 651–655.
- ICPR-1996-CordellaFSV #algorithm #performance #using
- An efficient algorithm for the inexact matching of ARG graphs using a contextual transformational model (LPC, PF, CS, MV), pp. 180–184.
- ICPR-1996-DelagnesB #image #markov #random
- Rectilinear structure extraction in textured images with an irregular, graph-based Markov random field model (PD, DB), pp. 800–804.
- ICPR-1996-LiuCC #online #order #recognition #relational #using
- Stroke order and stroke number free on-line Chinese character recognition using attributed relational graph matching (JL, WkC, MMYC), pp. 259–263.
- ICPR-1996-LladosLM #comprehension #documentation #using
- Hand drawn document understanding using the straight line Hough transform and graph matching (JL, JLK, EM), pp. 497–501.
- ICPR-1996-WegnerHOF #image #segmentation
- The watershed transformation on graphs for the segmentation of CT images (SW, TH, HO, EF), pp. 498–502.
- PLDI-1996-SreedharGL #analysis #data flow #framework #incremental #using
- A New Framework for Exhaustive and Incremental Data Flow Analysis Using DJ Graphs (VCS, GRG, YFL), pp. 278–290.
- PLILP-1996-Kessler #scheduling
- Scheduling Expression DAGs for Minimal Register Need (CWK), pp. 228–242.
- PLILP-1996-WeyerW #analysis #prolog
- Annotated Structure Shape Graphs for Abstract Analysis of Prolog (GW, WHW), pp. 92–106.
- POPL-1996-GhiyaH #analysis #c #pointer
- Is it a Tree, a DAG, or a Cyclic Graph? A Shape Analysis for Heap-Directed Pointers in C (RG, LJH), pp. 1–15.
- ICSE-1996-MurphyNL #empirical
- An Empirical Study of Static Call Graph Extractors (GCM, DN, ESCL), pp. 90–99.
- ICSE-1996-Zamperoni #development #named #re-engineering
- GRIDS — GRaph-based, Integrated Development of Software: Integrating Different Perspectives of Software Engineering (AZ), pp. 48–59.
- SAC-1996-LiK #c++ #case study #design #implementation #object-oriented #reuse
- An object-oriented design and implementation of reusable graph objects with C++: a case study (WNL, RK), pp. 510–514.
- CC-1996-Cifuentes
- Structuring Decompiled Graphs (CC), pp. 91–105.
- DAC-1996-ParulkarGB #bound #data flow
- Lower Bounds on Test Resources for Scheduled Data Flow Graphs (IP, SKG, MAB), pp. 143–148.
- PDP-1996-ColiP #parallel #precedence
- Load Balancing with Internode Precedence Relations: A New Method for Static Allocation of DAGs into Parallel Systems (MC, PP), pp. 252–257.
- PDP-1996-WaiteRI #architecture #parallel #reduction
- Parallel Graph Reduction with the PACE Architecture (MEW, TJR, FZI), pp. 448–454.
- STOC-1996-BabaiGKRSW #bound #source code
- Extremal Bipartite Graphs and Superpolynomial Lower Bounds for Monotone Span Programs (LB, AG, JK, LR, TS, AW), pp. 603–611.
- STOC-1996-BartalFL #bound #online #problem
- Lower Bounds for On-line Graph Problems with Application to On-line Circuit and Optical Routing (YB, AF, SL), pp. 531–540.
- STOC-1996-Mohar #linear
- Embedding Graphs in an Arbitrary Surface in Linear Time (BM), pp. 392–397.
- STOC-1996-NagamochiI
- Deterministic Õ(nm) Time Edge-Splitting in Undirected Graphs (HN, TI), pp. 64–73.
- STOC-1996-RobertsonSST
- Efficiently Four-Coloring Planar Graphs (NR, DPS, PDS, RT), pp. 571–575.
- STOC-1996-Spielman #morphism #performance #testing
- Faster Isomorphism Testing of Strongly Regular Graphs (DAS), pp. 576–584.
- LICS-1996-McColm #random
- Zero-One Laws for Gilbert Random Graphs (GLM), pp. 360–369.
- ICDAR-v1-1995-Ishitani #comprehension #image
- Model matching based on association graph for form image understanding (YI), pp. 287–292.
- ICDAR-v2-1995-FilatovGK #recognition #string
- Graph-based handwritten digit string recognition (AF, AG, IK), pp. 845–848.
- ICDAR-v2-1995-PavlidisSS #analysis
- Matching graph embeddings for shape analysis (TP, WJS, HS), pp. 729–733.
- ICDAR-v2-1995-YangC #automation #concept #generative #hypermedia
- Automatic hypertext link generation based on conceptual graphs (GCY, KSC), pp. 702–705.
- ICDAR-v2-1995-YuanTS
- Four directional adjacency graphs (FDAG) and their application in locating fields in forms (JY, YYT, CYS), pp. 752–755.
- ICSM-1995-CanforaC #algorithm #dependence
- Algorithms for program dependence graph production (GC, AC), p. 157–?.
- ICALP-1995-Balcazar #complexity
- The Complexity of Searching Succinctly Represented Graphs (JLB), pp. 208–219.
- ICALP-1995-BodlaenderF
- Intervalizing k-Colored Graphs (HLB, BdF), pp. 87–98.
- ICALP-1995-ChaudhuriZ #query
- Shortest Path Queries in Digraphs of Small Treewidth (SC, CDZ), pp. 244–255.
- ICALP-1995-CorneilOS #algorithm #linear
- Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs (DGC, SO, LS), pp. 292–302.
- ICALP-1995-NikoletseasRSY #memory management #probability
- Stochastic Graphs Have Short Memory: Fully Dynamic Connectivity in Poly-Log Expected Time (SEN, JHR, PGS, MY), pp. 159–170.
- ICALP-1995-ParraS #how
- How to Use the Minimal Separators of a Graph for its Chordal Triangulation (AP, PS), pp. 123–134.
- ICALP-1995-Schwentick #monad
- Graph Connectivity, Monadic NP and Built-in Relations of Moderate Degree (TS), pp. 405–416.
TLCA-1995-AspertiL #λ-calculus- Comparing λ-calculus translations in Sharing Graphs (AA, CL), pp. 1–15.
AFP-1995-Launchbury95 #algorithm #functional- Graph Algorithms with a Functional Flavous (JL), pp. 308–331.
- CIKM-1995-ParkST #algorithm #concurrent #detection #distributed #generative #hybrid
- A Distributed Deadlock Detection and Resolution Algorithm Based on A Hybrid Wait-for Graph and Probe Generation Scheme (YCP, PS, HLT), pp. 378–386.
- ICML-1995-OliveiraS #order
- Inferring Reduced Ordered Decision Graphs of Minimum Description Length (ALO, ALSV), pp. 421–429.
- SEKE-1995-ArefiMW #automation #editing
- The Graph Editor of EdGen, A Tool to Aid the Automated Construction of Customized Graph Editors (FA, MM, AW), pp. 438–445.
- SEKE-1995-CostagliolaLOT #data flow #parsing #performance
- Efficient Parsing of Data-Flow Graphs (GC, ADL, SO, GT), pp. 226–233.
- SEKE-1995-Westfechtel #process
- A Graph-Based Model for Dynamic Process Nets (BW), pp. 126–130.
- POPL-1995-RepsHS #analysis #data flow #interprocedural #precise #reachability
- Precise Interprocedural Dataflow Analysis via Graph Reachability (TWR, SH, SS), pp. 49–61.
- SAC-1995-AbualiWS #encoding #representation
- Determinant factorization and cycle basis: encoding schemes for the representation of spanning trees on incomplete graphs (FNA, RLW, DAS), pp. 305–312.
- DAC-1995-BredenfeldC #design #integration #tool support #using
- Tool Integration and Construction Using Generated Graph-Based Design Representations (AB, RC), pp. 94–99.
- DAC-1995-LiuKCH #approach #clustering #replication #using
- Performance-Driven Partitioning Using a Replication Graph Approach (LTL, MTK, CKC, TCH), pp. 206–210.
- DAC-1995-ZepterGM #data flow #design #generative #using
- Digital Receiver Design Using VHDL Generation from Data Flow Graphs (PZ, TG, HM), pp. 228–233.
- PDP-1995-AudenaertL #concurrent #detection #parallel #performance #source code
- Space efficient data race detection for parallel programs with series-parallel task graphs (KA, LL), pp. 508–515.
- PDP-1995-BangC #distributed #memory management #reduction
- Distributed shared memory for function-grained graph reduction machine (DWB, YKC), pp. 148–155.
- PDP-1995-ChabridonG #parallel
- Dependable parallel computing with agents based on a task graph model (SC, EG), pp. 350–357.
- STOC-1995-BorchersD
- The k-Steiner ratio in graphs (AB, DZD), pp. 641–649.
- STOC-1995-DinitzN #incremental #maintenance
- A 2-level cactus model for the system of minimum and minimum+1 edge-cuts in a graph and its incremental maintenance (YD, ZN), pp. 509–518.
- STOC-1995-Feige #random
- Randomized graph products, chromatic numbers, and Lovasz theta-function (UF), pp. 635–640.
- STOC-1995-HenzingerK #algorithm #random
- Randomized dynamic graph algorithms with polylogarithmic time per operation (MRH, VK), pp. 519–527.
- STOC-1995-RaschleS #recognition
- Recognition of graphs with threshold dimension two (TR, KS), pp. 650–661.
- ICLP-1995-Brand #algorithm
- A Decision Graph Algorithm for CCP Languages (PB), pp. 433–447.
- LICS-1995-LynchT #logic #random
- The Infinitary Logic of Sparse Random Graphs (JFL, JT), pp. 46–53.
- PODS-1994-Afrati #bound #datalog #exclamation #query
- Bounded Arity Datalog (!=) Queries on Graphs (FNA), pp. 97–106.
- VLDB-1994-GutierrezPST #database #persistent
- Database Graph Views: A Practical Model to Manage Persistent Graphs (AG, PP, HS, JMT), pp. 391–402.
- VLDB-1994-Guting #database #modelling #named #query
- GraphDB: Modeling and Querying Graphs in Databases (RHG), pp. 297–308.
- ICSM-1994-KinlochM #c #comprehension #representation #source code #using
- Understanding C Programs Using the Combined C Graph Representation (DAK, MM), pp. 172–180.
- ICALP-1994-Feige #algorithm #performance #random
- A Fast Randomized LOGSPACE Algorithm for Graph Connectivity (UF), pp. 499–507.
- ICALP-1994-GargVY #multi
- Multiway Cuts in Directed and Node Weighted Graphs (NG, VVV, MY), pp. 487–498.
- ICALP-1994-HoftingW #analysis #polynomial
- Polynomial Time Analysis of Torodial Periodic Graphs (FH, EW), pp. 544–555.
- ICALP-1994-NikolestseasPSY #multi #network #random #reliability
- Short Vertex Disjoint Paths and Multiconnectivity in Random Graphs: Reliable Network Computing (SEN, KVP, PGS, MY), pp. 508–519.
- TAGT-1994-ArnborgP #bound #subclass
- A Technique for Recognizing Graphs of Bounded Treewidth with Application to Subclasses of Partial 2-Paths (SA, AP), pp. 469–486.
- TAGT-1994-Bauderon #approach #generative #infinity
- A Category-Theoretical Approach to Vertex Replacement: The Generation of Infinite Graphs (MB), pp. 27–37.
- TAGT-1994-BrandenburgS #automaton #linear
- Graph Automata for Linear Graph Languages (FJB, KS), pp. 336–350.
- TAGT-1994-Courcelle #composition #higher-order #logic #monad
- The Definition in Monadic Second-Order Logic of Modular Decompositions of Ordered Graphs (BC), pp. 487–501.
- TAGT-1994-CourcelleS #set
- The Obstructions of a Minor-Closed Set of Graphs Defined by Hyperedge Replacement can be Constructed (BC, GS), pp. 351–367.
- TAGT-1994-Drewes #algebra #transducer #using
- The Use of Tree Transducers to Compute Translations Between Graph Algebras (FD), pp. 196–210.
- TAGT-1994-EhrenfeuchtHR #graph transformation
- Group Based Graph Transformations and Hierarchical Representations of Graphs (AE, TH, GR), pp. 502–520.
- TAGT-1994-EngelfrietV
- Concatenation of Graphs (JE, JJV), pp. 368–382.
- TAGT-1994-PlumpH #unification
- Graph Unification and Matching (DP, AH), pp. 75–88.
- TAGT-1994-Wills #parsing #source code #using
- Using Attributed Flow Graph Parsing to Recognize Clichés in Programs (LMW), pp. 170–184.
- TAGT-1994-ZinssmeisterM #graph grammar
- Drawing Graphs with Attribute Graph Grammars (GZ, CM), pp. 443–453.
- TAGT-1994-Zundorf #pattern matching
- Graph Pattern Matching in PROGRES (AZ), pp. 454–468.
- CIKM-1994-ChenH #algorithm #linear #source code #traversal
- An Optimal Graph Traversal Algorithm for Evaluating Linear Binary-Chain Programs (YC, TH), pp. 34–41.
- CIKM-1994-ZhaoZ #approach #database #roadmap #traversal
- Spatial Data Traversal in Road Map Databases: A Graph Indexing Approach (JLZ, AZ), pp. 355–362.
- KDD-1994-Gaines #exception
- Exception Dags as Knowledge Structures (BRG), pp. 13–24.
- KR-1994-KoenigS #probability
- Risk-Sensitive Planning with Probabilistic Decision Graphs (SK, RGS), pp. 363–373.
- ALP-1994-JonesR #functional #higher-order
- Higher-Order Minimal Functional Graphs (NDJ, MR), pp. 242–252.
- PLDI-1994-HentenryckCC #analysis #prolog #using
- Type Analysis of Prolog Using Type Graphs (PVH, AC, BLC), pp. 337–348.
- PLDI-1994-NorrisP #dependence
- Register Allocation over the Program Dependence Graph (CN, LLP), pp. 266–277.
- PLILP-1994-MaraistS #functional #reduction
- A Graph Reduction Technique with Sharing across Narrowings for Functional-Logic Languages (JM, FSKS), pp. 355–369.
- POPL-1994-WeiseCES #dependence #representation
- Value Dependence Graphs: Representation without Taxation (DW, RFC, MDE, BS), pp. 297–310.
- SAC-1994-Li #equivalence #on the
- On the equivalence of pull-up transistor assignment in PLA folding and distribution graph (WNL), pp. 374–378.
- SAC-1994-RayJD #algorithm #array #linear #parallel
- A parallel algorithm for mapping a special class of task graphs onto linear array multiprocessors (SR, HJ, JSD), pp. 473–477.
- SAC-1994-Silva-Lepe #object-oriented #source code #specification
- Abstracting graph-based specifications of object-oriented programs (ISL), pp. 447–451.
- SAC-1994-Takaoka #parallel #verification
- Parallel program verification with directed graphs (TT), pp. 462–466.
- CC-1994-Binkley #constant #data flow #dependence #interprocedural #using
- Interprocedural Constant Propagation using Dependence Graphs and a Data-Flow Model (DB), pp. 374–388.
- CC-1994-FauthHKM
- Global Code Selection of Directed Acyclic Graphs (AF, GH, AK, CM), pp. 128–142.
- EDAC-1994-DepuydtGGM #optimisation #pipes and filters #scheduling
- Optimal Scheduling and Software Pipelining of Repetitive Signal Flow Graphs with Delay Line Optimization (FD, WG, GG, HDM), pp. 490–494.
- EDAC-1994-EsbensenM #algorithm #problem #search-based
- A Genetic Algorithm for the Steiner Problem in a Graph (HE, PM), pp. 402–406.
- EDAC-1994-VanbekbergenYLM #interface #specification
- A Generalized Signal Transition Graph Model for Specification of Complex Interfaces (PV, CYC, BL, HDM), pp. 378–384.
- HPDC-1994-LeangsuksunPS
- A Task Graph Centroid (CL, JLP, SLS), pp. 219–225.
- STOC-1994-AlonK #random
- A spectral technique for coloring random 3-colorable graphs (NA, NK), pp. 346–355.
- STOC-1994-AlonYZ #named #scalability
- Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs (NA, RY, UZ), pp. 326–335.
- STOC-1994-DinitzV #incremental #maintenance #set
- The connectivity carcass of a vertex subset in a graph and its incremental maintenance (YD, AV), pp. 716–725.
- STOC-1994-Gabow #algorithm #performance
- Efficient splitting off algorithms for graphs (HNG), pp. 696–705.
- STOC-1994-HalldorssonR #approximate #bound #independence #set
- Greed is good: approximating independent sets in sparse and bounded-degree graphs (MMH, JR), pp. 439–448.
- STOC-1994-KleinRRS #algorithm #performance
- Faster shortest-path algorithms for planar graphs (PNK, SR, MRH, SS), pp. 27–37.
- CAV-1994-HojatiMB #using
- Improving Language Containment Using Fairness Graphs (RH, RBMT, RKB), pp. 391–403.
- LICS-1994-Jeffrey #concurrent #reduction #semantics
- A Fully Abstract Semantics for Concurrent Graph Reduction (AJ), pp. 82–91.
- LICS-1994-RobinsonR #morphism #parametricity #polymorphism #reflexive
- Reflexive Graphs and Parametric Polymorphism (EPR, GR), pp. 364–371.
- ICDAR-1993-AbuhaibaA #fuzzy #recognition
- Totally unconstrained handwritten numeral recognition via fuzzy graphs (ISIA, PA), pp. 846–849.
- ICDAR-1993-DeseillignyMS #algorithm #comprehension #network #re-engineering
- Map understanding for GIS data capture: Algorithms for road network graph reconstruction (MPD, HLM, GS), pp. 676–679.
- ICDAR-1993-HullL #database #documentation #recognition #word
- Interpreting word recognition decisions with a document database graph (JJH, YL), pp. 488–492.
- ICDAR-1993-MonaganR #representation #using
- Appropriate base representation using a run graph (GM, MR), pp. 623–626.
- PODS-1993-NodineGV
- Blocking for External Graph Searching (MHN, MTG, JSV), pp. 222–232.
- ICALP-1993-BodlaenderKK #permutation
- Treewidth and Pathwidth of Permutation Graphs (HLB, TK, DK), pp. 114–125.
- ICALP-1993-CzumajG #problem
- Problems on Pairs of Trees and the Four Colour Problem of Planar Graphs (AC, AG), pp. 88–101.
- RTA-1993-Ariola #modelling #term rewriting
- Relating Graph and Term Rewriting via Böhm Models (ZMA), pp. 183–197.
- RTA-1993-Field #approach #incremental #reduction #term rewriting
- A Graph Reduction Approach to Incremental Term Rewriting (JF), pp. 259–273.
- HCI-SHI-1993-ChenTW #automation #editing #object-oriented #paradigm
- Automated Construction of Application-Specific Graph Editors in an Object-Oriented Paradigm (MC, PT, CYW), pp. 415–420.
- INTERCHI-1993-BrownMS #perspective #using
- Browsing graphs using a fisheye view (MHB, JRM, MS), p. 516.
- PEPM-1993-Vasell #data flow
- A Partial Evaluator for Data Flow Graphs (JV), pp. 206–215.
- PLILP-1993-ClarkH
- A Lattice of Abstract Graphs (DC, CH), pp. 318–331.
- POPL-1993-BatesH #dependence #incremental #testing #using
- Incremental Program Testing Using Program Dependence Graphs (SB, SH), pp. 384–396.
- POPL-1993-KlarlundS
- Graph Types (NK, MIS), pp. 196–205.
- POPL-1993-Lakhotia #dependence #multi #using
- Constructing Call Multigraphs Using Dependence Graphs (AL), pp. 273–284.
- RE-1993-RyanM #concept #requirements
- Matching conceptual graphs as an aid to requirements re-use (KR, BM), pp. 112–120.
- ICSE-1993-KleynB #programming #specification
- A High Level Language for Specifying Graph Based Languages and Their Programming Environments (MFK, JCB), pp. 324–335.
- SAC-1993-KountanisS #concept #learning
- Graphs as a Language to Describe Learning System Concepts (DIK, ES), pp. 469–475.
- SAC-1993-YangO #concept #information management #retrieval
- Knowledge Acquisition and Retrieval Based on Conceptual Graphs (GCY, JO), pp. 476–481.
- DAC-1993-PanDL #constraints #layout #reduction
- Optimal Graph Constraint Reduction for Symbolic Layout Compaction (PP, SkD, CLL), pp. 401–406.
- PDP-1993-BennaniDLT #comparison #evaluation #functional #parallel #reduction
- A comparison between the graph reduction model and an original parallel evaluation scheme for functional languages (NB, ND, MPL, BT), pp. 124–130.
- STOC-1993-AlonCG #permutation
- Routing permutations on graphs via matchings (NA, FRKC, RLG), pp. 583–591.
- STOC-1993-BarnesF #random
- Short random walks on graphs (GB, UF), pp. 728–737.
- STOC-1993-BattistaV
- Angles of planar triangular graphs (GDB, LV), pp. 431–437.
- STOC-1993-EppsteinGIS #algorithm
- Separator based sparsification for dynamic planar graph algorithms (DE, ZG, GFI, THS), pp. 208–217.
- STOC-1993-Goldberg #algorithm #polynomial #product line
- Polynomial space polynomial delay algorithms for listing families of graphs (LAG), pp. 218–225.
- STOC-1993-KenyonRS
- Matchings in lattice graphs (CK, DR, AS), pp. 738–746.
- STOC-1993-ParkP
- Finding minimum-quotient cuts in planar graphs (JKP, CAP), pp. 766–775.
- STOC-1993-SzegedyV #locality
- Locality based graph coloring (MS, SV), pp. 201–207.
- ISSTA-1993-HarroldMR #dependence #performance
- Efficient Construction of Program Dependence Graphs (MJH, BAM, GR), pp. 160–170.
- IWPTS-1993-Drira #trade-off #verification
- The Refusal Graph: a Tradeoff between Verification and Test (KD), pp. 297–312.
- HT-ECHT-1992-AmannS #named #query
- Gram: A Graph Data Model and Query Language (BA, MS), pp. 201–211.
- ICALP-1992-KhullerT #algorithm #approximate
- Approximation Algorithms for Graph Augmentation (SK, RT), pp. 330–341.
- ICALP-1992-PatersonY #nearest neighbour #on the
- On Nearest-Neighbor Graphs (MP, FFY), pp. 416–426.
- ICALP-1992-Poutre #component #maintenance
- Maintenance of Triconnected Components of Graphs (JALP), pp. 354–365.
- CHI-1992-SarkarB #visual notation
- Graphical Fisheye Views of Graphs (MS, MHB), pp. 83–91.
- CAiSE-1992-GhoshW #concept #database #deduction #framework #object-oriented
- Conceptual Graphs as a Framework for Deductive Object-Oriented Databases (BCG, VW), pp. 147–163.
- SEKE-1992-KaoH #logic #proving #realtime
- A Graph Proof Procedure for Real Time Logic (JHK, LJH), pp. 300–306.
TRI-Ada-C-1992-MayrhauserH #ada #algorithm #communication #concurrent #testing- An Ada Deadlock Testing Algorithm Based on Control and Communication Flow Graphs (AvM, SMSH), pp. 450–457.
- WSA-1992-MycroftR
- Minimal Function Graphs are not Instrumented (AM, MR), pp. 60–67.
- ICSE-1992-HorwitzR #dependence #re-engineering #using
- The Use of Program Dependence Graphs in Software Engineering (SH, TWR), pp. 392–411.
- CC-1992-HendrenGAM #framework
- A Register Allocation Framework Based on Hierarchical Cyclic Interval Graphs (LJH, GRG, ERA, CM), pp. 176–191.
- DAC-1992-Boyer #constraints #independence #process
- Process Independent Constraint Graph Compaction (DGB), pp. 318–322.
- DAC-1992-KimLS #layout #modelling #using
- A New Hierarchical Layout Compactor Using Simplified Graph Models (WK, JL, HS), pp. 323–326.
- DAC-1992-LavagnoMBS #problem
- Solving the State Assignment Problem for Signal Transition Graphs (LL, CWM, RKB, ALSV), pp. 568–572.
- DAC-1992-WangW #optimisation
- A Graph Theoretic Technique to Speed up Floorplan Area Optimization (TCW, DFW), pp. 62–68.
- IWMM-1992-Rojemo #concurrent #garbage collection #parallel #reduction
- A Concurrent Generational Garbage Collector for a Parallel Graph Reducer (NR), pp. 440–453.
- IWMM-1992-Seward #garbage collection #lazy evaluation #reduction
- Generational Garbage Collection for Lazy Graph Reduction (JS), pp. 200–217.
- ESOP-1992-Andersen #model checking
- Model Checking and Boolean Graphs (HRA), pp. 1–19.
- STOC-1992-BroderFU
- Existence and Construction of Edge Disjoint Paths on Expander Graphs (AZB, AMF, EU), pp. 140–149.
- STOC-1992-DorT #composition #proving
- Graph Decomposition Is NPC-A Complete Proof of Holyer’s Conjecture (DD, MT), pp. 252–263.
- STOC-1992-KhullerV #approximate
- Biconnectivity Approximations and Graph Carvings (SK, UV), pp. 759–770.
- STOC-1992-MalitzP #on the
- On the Angular Resolution of Planar Graphs (SMM, AP), pp. 527–538.
- STOC-1992-Rao #algorithm #performance
- Faster Algorithms for Finding Small Edge Cuts in Planar Graphs (SR), pp. 229–240.
- ICALP-1991-BodlaenderK #algorithm
- Better Algorithms for the Pathwidth and Treewidth of Graphs (HLB, TK), pp. 544–555.
- ICALP-1991-DjidjevPZ
- Computing Shortest Paths and Distances in Planar Graphs (HD, GEP, CDZ), pp. 327–338.
- ICALP-1991-Furer #algorithm #performance
- An Efficient NC Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs (MF), pp. 429–440.
- ICALP-1991-GalilI #component #maintenance
- Maintaining Biconnected Components of Dynamic Planar Graphs (ZG, GFI), pp. 339–350.
- ICALP-1991-Loebl #performance #polynomial
- Efficient Maximal Cubic Graph Cuts (ML), pp. 351–362.
- ICALP-1991-RaviAK #approximate #problem #scheduling
- Ordering Problems Approximated: Single-Processor Scheduling and Interval Graph Completion (RR, AA, PNK), pp. 751–762.
- RTA-1991-ChabinR
- Narrowing Directed by a Graph of Terms (JC, PR), pp. 112–123.
- CHI-1991-Lohse #comprehension
- A cognitive model for the perception and understanding of graphs (JL), pp. 137–144.
- TOOLS-USA-1991-Wilk #co-evolution #dependence
- Change Propagation in Object Dependency Graphs (MRW), pp. 233–248.
- PLDI-1991-CallahanK
- Register Allocation via Hierarchical Graph Coloring (DC, BK), pp. 192–203.
- POPL-1991-ChoiCF #automation #data flow #evaluation
- Automatic Construction of Sparse Data Flow Evaluation Graphs (JDC, RC, JF), pp. 55–66.
- POPL-1991-PingaliBJMS #algebra #approach #dependence
- Dependence Flow Graphs: An Algebraic Approach to Program Dependencies (KP, MB, RJ, MM, PS), pp. 67–78.
- DAC-1991-Chen #clustering #concurrent #scheduling
- Graph Partitioning for Concurrent Test Scheduling in VLSI Circuit (CIHC), pp. 287–290.
- STOC-1991-Babai #finite #generative #random #transitive
- Local Expansion of Vertex-Transitive Graphs and Random Generation in Finite Groups (LB), pp. 164–174.
- STOC-1991-FederM #algorithm #clique
- Clique Partitions, Graph Compression, and Speeding-Up Algorithms (TF, RM), pp. 123–133.
- STOC-1991-Harel #infinity
- Hamiltonian Paths in Infinite Graphs (DH), pp. 220–229.
- CAV-1991-FinkelP #composition
- Avoiding State Exposion by Composition of Minimal Covering Graphs (AF, LP), pp. 169–180.
- PODS-1990-FeketeLW #transaction
- A Serialization Graph Construction for Nested Transactions (AF, NAL, WEW), pp. 94–108.
- PODS-1990-Yannakakis #database
- Graph-Theoretic Methods in Database Theory (MY), pp. 230–242.
- SIGMOD-1990-RosenthalG #implementation #query
- Query Graphs, Implementing Trees, and Freely-Reorderable Outerjoins (AR, CAGL), pp. 291–299.
- ICALP-1990-BattistaT #algorithm #online
- On-Line Graph Algorithms with SPQR-Trees (GDB, RT), pp. 598–611.
- ICALP-1990-Blum #approach
- A New Approach to Maximum Matching in General Graphs (NB), pp. 586–597.
- GG-1990-ArnborgCPS #algebra #reduction
- An Algebraic Theory of Graph Reduction (SA, BC, AP, DS), pp. 70–83.
- GG-1990-BaileyCF #programming #scalability
- Programming with Very Large Graphs (DAB, JEC, CDF), pp. 84–97.
- GG-1990-Courcelle #logic
- The Logical Exprssion of Graph Properties (BC), pp. 38–40.
- GG-1990-Courcelle90a #algebra #approach #logic #relational
- Graphs as Relational Structures: An Algebraic an Logical Approach (BC), pp. 238–252.
- GG-1990-Engelfriet #higher-order #logic #monad
- A Characterization of Context-Free NCE Graph Languages by Monadic Second-Order Logic on Trees (JE), pp. 311–327.
- GG-1990-JanssensR
- Structured Transformations and Computation Graphs for Actor Grammars (DJ, GR), pp. 446–460.
- GG-1990-LitovskyM
- Computing with Graph Relabelling Systems with Priorities (IL, YM), pp. 549–563.
- GG-1990-Rosenfeld
- A Note on Graph Decimation (AR), pp. 637–640.
- GG-1990-Vogler #polynomial
- Recognizing Edge Replacement Graph Languages in Cubic Time (WV), pp. 676–687.
- CHI-1990-BohringerP #algorithm #automation #constraints #layout #using
- Using constraints to achieve stability in automatic graph layout algorithms (KFB, FNP), pp. 43–51.
- ML-1990-Segen #clustering #learning
- Graph Clustering and Model Learning by Data Compression (JS), pp. 93–101.
- SIGIR-1990-BooksteinK
- Construction of Optimal Graphs for Bit-Vector Compression (AB, STK), pp. 327–342.
- ALP-1990-Han #query #recursion
- Recursive Query Processing in Predicate-Goal Graph (JLH), pp. 247–261.
- ALP-1990-Moreno-NavarroKLR #lazy evaluation
- Lazy Narrowing in a Graph Machine (JJMN, HK, RL, MRA), pp. 298–317.
- PLDI-1990-Nickerson #multi
- Graph Coloring Register Allocation for Processors with Multi-Register Operands (BRN), pp. 40–52.
- ESOP-1990-KuchenLMR #functional #implementation #logic
- Graph-based Implementation of a Functional Logic Langugage (HK, RL, JJMN, MRA), pp. 271–290.
- ESOP-1990-SteffenKR #program transformation #representation
- The Value Flow Graph: A Program Representation for Optimal Program Transformations (BS, JK, OR), pp. 389–405.
- STOC-1990-AlonST #theorem
- A Separator Theorem for Graphs with an Excluded Minor and its Applications (NA, PDS, RT), pp. 293–299.
- STOC-1990-CoppersmithDRS #algorithm #online #random
- Random Walks on Weighted Graphs, and Applications to On-line Algorithms (DC, PD, PR, MS), pp. 369–378.
- STOC-1990-KaoK #algorithm #parallel #performance #towards #transitive
- Towards Overcoming the Transitive-Closure Bottleneck: Efficient Parallel Algorithms for Planar Digraphs (MYK, PNK), pp. 181–192.
- CAV-1990-JanickiK #reachability #simulation #using
- Using Optimal Simulations to Reduce Reachability Graphs (RJ, MK), pp. 166–175.
- CLP-1990-SchreyeVB90 #detection #horn clause #query #strict #using
- A Practical Technique for Detecting Non-terminating Queries for a Restricted Class of Horn Clauses, Using Directed, Weighted Graphs (DDS, KV, MB), pp. 649–663.
- CSL-1990-Ranaivoson #bound #problem
- Nontrivial Lower Bounds for some NP-Problems on Directed Graphs (SR), pp. 318–339.
- LICS-1990-Courcelle #higher-order #monad #on the #set
- On the Expression of Monadic Second-Order Graph Properties Without Quantifications Over Sets of Edges (BC), pp. 190–196.
- NACLP-1990-KligerS
- From Decision Trees to Decision Graphs (SK, EYS), pp. 97–116.
- VLDB-1989-MendelzonW #database
- Finding Regular Simple Paths in Graph Databases (AOM, PTW), pp. 185–193.
- ICALP-1989-Courcelle #equation #higher-order #logic #monad
- The Definability of Equational Graphs in Monadic Second-Order Logic (BC), pp. 207–221.
FPCA-1989-AugustssonJ #parallel #reduction- Parallel Graph Reduction with the -Machine (LA, TJ), pp. 202–213.
- FPCA-1989-George #automaton #parallel #reduction
- An Abstract Machine for Parallel Graph Reduction (LG), pp. 214–229.
- KR-1989-Leishman #concept
- Analogy as a Constrained Partial Correspondence Over Conceptual Graphs (DL), pp. 223–234.
- PLDI-1989-CytronHH #automation #generative #parallel
- Automatic Generation of DAG Parallelism (RC, MH, WCH), pp. 54–68.
- PLDI-1989-KoopmanL #combinator #fresh look #reduction
- A Fresh Look at Combinator Graph Reduction (PJKJ, PL), pp. 110–119.
- POPL-1989-BaxterB #dependence
- The Program Dependence Graph and Vectorization (WB, HRBI), pp. 1–11.
- POPL-1989-Selke #dependence #semantics
- A Rewriting Semantics for Program Dependence Graphs (RPS), pp. 12–24.
- ICSE-1989-LongC #analysis #concurrent #interactive
- Task Interaction Graphs for Concurrency Analysis (DLL, LAC), pp. 44–52.
- DAC-1989-BuiHJL #algorithm #performance
- Improving the Performance of the Kernighan-Lin and Simulated Annealing Graph Bisection Algorithms (TNB, CH, CJ, FTL), pp. 775–778.
- DAC-1989-Chowdhury #design #network #reliability
- Optimum Design of Reliable IC Power Networks Having General Graph Topologies (SC), pp. 787–790.
- DAC-1989-LokanathanK #performance
- Performance optimized floor planning by graph planarization (BL, EK), pp. 116–121.
- DAC-1989-PotkonjackR #algorithm #resource management #scheduling
- A Scheduling and Resource Allocation Algorithm for Hierarchical Signal Flow Graphs (MP, JMR), pp. 7–12.
- CAAP-1989-Baeza-Yates #sequence
- The Subsequence Graph of a Text (RABY), pp. 104–118.
- STOC-1989-AggarwalAK #parallel
- Parallel Depth-First Search in General Directed Graphs (AA, RJA, MYK), pp. 297–308.
- STOC-1989-ChandraRRST
- The Electrical Resistance of a Graph Captures its Commute and Cover Times (AKC, PR, WLR, RS, PT), pp. 574–586.
- STOC-1989-CohenM #algorithm #detection #polynomial
- Strongly Polynomial-Time and NC Algorithms for Detecting Cycles in Dynamic Graphs (EC, NM), pp. 523–534.
- STOC-1989-FriedmanKS #on the #random
- On the Second Eigenvalue in Random Regular Graphs (JF, JK, ES), pp. 587–598.
- STOC-1989-Motwani #algorithm #analysis #problem
- Expanding Graphs and the Average-case Analysis of Algorithms for Matchings and Related Problems (RM), pp. 550–561.
- PODS-1988-Hadzilacos #algorithm #concurrent #multi
- Serialization Graph Algorithms for Multiversion Concurrency Control (TH), pp. 135–141.
- ICALP-1988-ArnborgLS #problem
- Problems Easy for Tree-Decomposable Graphs (SA, JL, DS), pp. 38–51.
- ICALP-1988-Bodlaender #bound #programming
- Dynamic Programming on Graphs with Bounded Treewidth (HLB), pp. 105–118.
- ICALP-1988-LengauerW #analysis #performance
- Efficient Analysis of Graph Properties on Context-free Graph Languages (TL, EW), pp. 379–393.
- ICALP-1988-LingasS #algorithm #morphism #polynomial
- A Polynomial-Time Algorithm for Subgraph Isomorphism of Two-Connected Series-Parallel Graphs (AL, MMS), pp. 394–409.
- ICALP-1988-Tamassia #data type
- A Dynamic Data Structure for Planar Graph Embedding (RT), pp. 576–590.
- ICALP-1988-VaziraniY
- Pfaffian Orientations, 0/1 Permanents, and Even Cycles in Directed Graphs (VVV, MY), pp. 667–681.
LFP-1988-Goldberg #multi #named #reduction- Buckwheat: Graph Reduction on a Shared-Memory Multiprocessor (BG), pp. 40–51.
- ML-1988-Segen #learning #modelling
- Learning Graph Models of Shape (JS), pp. 29–35.
- PLDI-1988-Callahan #analysis #data flow #interprocedural #summary
- The Program Summary Graph and Flow-Sensitive Interprocedural Data Flow Analysis (DC), pp. 47–56.
- PLDI-1988-HorwitzRB #dependence #interprocedural #slicing #using
- Interprocedural Slicing Using Dependence Graphs (SH, TWR, DB), pp. 35–46.
- POPL-1988-HorwitzPR88a #dependence #on the #representation #source code
- On the Adequacy of Program Dependence Graphs for Representing Programs (SH, JP, TWR), pp. 146–157.
- Best-of-PLDI-1988-HorwitzRB88a #dependence #interprocedural #slicing #using
- Interprocedural slicing using dependence graphs (with retrospective) (SH, TWR, DB), pp. 229–243.
- DAC-1988-HarelK #approach #fault #simulation
- A Graph Compaction Approach to Fault Simulation (DH, BK), pp. 601–604.
- DAC-1988-Jabri #automation
- Automatic Building of Graphs for Rectangular Dualisation (MAJ), pp. 638–641.
- ESOP-1988-KaplanK #abstraction #concurrent #named #programming
- Garp: Graph Abstractions for Concurrent Programming (SMK, GEK), pp. 191–205.
- STOC-1988-FraysseixPP #set
- Small Sets Supporting Fáry Embeddings of Planar Graphs (HdF, JP, RP), pp. 426–433.
- STOC-1988-HajnalMT #communication #complexity #on the
- On the Communication Complexity of Graph Properties (AH, WM, GT), pp. 186–191.
- STOC-1988-KannanNR #representation
- Implicit Representation of Graphs (SK, MN, SR), pp. 334–343.
- STOC-1988-King #bound #complexity
- Lower Bounds on the Complexity of Graph Properties (VK), pp. 468–476.
- STOC-1988-KosarajuS #detection #polynomial
- Detecting Cycles in Dynamic Graphs in Polynomial Time (SRK, GFS), pp. 398–406.
- STOC-1988-VenkatesanL #problem #random
- Random Instances of a Graph Coloring Problem Are Hard (RV, LAL), pp. 217–222.
- CADE-1988-BlasiusS #equation #reasoning #unification
- Partial Unification for Graph Based Equational Reasoning (KHB, JHS), pp. 397–414.
- CADE-1988-Moser
- A Decision Procedure for Unquantified Formulas of Graph Theory (LEM), pp. 344–357.
- JICSCP-1988-BarklundHW88
- Condition Graphs (JB, NH, MW), pp. 435–446.
- ICALP-1987-CaiM #complexity #on the
- On the Complexity of Graph Critical Uncolorability (JyC, GEM), pp. 394–403.
- ICALP-1987-HagerupCD #parallel
- Parallel 5-Colouring of Planar Graphs (TH, MC, KD), pp. 304–313.
- ICALP-1987-Metivier #algorithm #automaton
- An Algorithm for Computing Asynchronous Automata in the Case of Acyclic Non-Commutation Graphs (YM), pp. 226–236.
- VDME-1987-Bjorner #development #metaprogramming
- The Stepwise Development of Software Development Graphs: Meta-Programming VDM Developments (DB), pp. 77–96.
- FPCA-1987-BrusELP #functional #named
- CLEAN: A language for functional graph writing (THB, MCJDvE, MOvL, MJP), pp. 364–384.
- FPCA-1987-JonesCSH #architecture #named #parallel #reduction
- GRIP — A high-performance architecture for parallel graph reduction (SLPJ, CDC, JS, MH), pp. 98–112.
- HCI-CE-1987-CampbellR
- Issues in Computer-Assisted Interpretation of Graphs and Quantitative Information (JAC, SPR), pp. 473–480.
ESEC-1987-TichyN #editing #knowledge-based- Knowledge-based Editors for Directed Graphs (WFT, FJN), pp. 101–109.
- DAC-1987-Keutzer #named #optimisation
- DAGON: Technology Binding and Local Optimization by DAG Matching (KK), pp. 341–347.
- CFLP-1987-PerceboisFDSB #architecture #distributed #multi #prolog #simulation
- Simulation Results of a Multiprocessor Prolog Architecture Based on a Distributed and/or Graph (CP, IF, ID, CS, BB), pp. 126–139.
- STOC-1987-Frederickson #approach
- A New Approach to All Pairs Shortest Paths in Planar Graphs (GNF), pp. 19–28.
- STOC-1987-GoldbergPS #parallel #symmetry
- Parallel Symmetry-Breaking in Sparse Graphs (AVG, SAP, GES), pp. 315–324.
- STOC-1987-HeathI
- The Pagenumber of Genus g Graphs is O(g) (LSH, SI), pp. 388–397.
- STOC-1987-IwanoS #infinity #testing
- Testing for Cycles in Infinite Graphs with Periodic Structure (KI, KS), pp. 46–55.
- STOC-1987-MillerR #algorithm #parallel
- A New Graph Triconnectivity Algorithm and Its Parallelization (GLM, VR), pp. 335–344.
- STOC-1987-NaorNS #algorithm #parallel #performance
- Fast Parallel Algorithms for Chordal Graphs (JN, MN, AAS), pp. 355–364.
- STOC-1987-PelegU
- Constructing Disjoint Paths on Expander Graphs (DP, EU), pp. 264–273.
- STOC-1987-ShelahS #random
- Threshold Spectra for Random Graphs (SS, JS), pp. 421–424.
- VLDB-1986-ChakravarthyM #database #deduction #multi #query #using
- Multiple Query Processing in Deductive Databases using Query Graphs (USC, JM), pp. 384–391.
- ICALP-1986-Felice #finite #set
- Finite Biprefix Sets of Path in a Graph (CdF), pp. 89–94.
- ICALP-1986-Simon #algorithm #transitive
- An Improved Algorithm for Transitive Closure on Acyclic Digraphs (KS), pp. 376–386.
- LFP-1986-Bawden
- Connection Graphs (AB), pp. 258–265.
- LFP-1986-Scheevel #named #reduction
- NORMA: A Graph Reduction Processor (MS), pp. 212–219.
- GG-1986-Courcelle #algebra #graph grammar #representation #term rewriting
- A representation of graphs by algebraic expressions and its use for graph rewriting systems (BC), pp. 112–132.
- GG-1986-Courcelle86a #higher-order #monad #on the #set
- On context-free sets of graphs and their monadic second-order theory (BC), pp. 133–146.
- GG-1986-Nagl86a #development
- A Software Development Environment based on Graph Technology (MN), pp. 458–478.
- GG-1986-Rozenberg
- An introduction to the NLC way of rewriting graphs (GR), pp. 55–66.
- CRAI-1986-Bjorner #development #formal method #metaprogramming #towards
- Project Graphs and Meta-Programs. Towards a Theory of Software Development (DB), pp. 117–152.
- POPL-1986-JonesM #analysis #data flow #source code #using
- Data Flow Analysis of Applicative Programs Using Minimal Function Graphs (NDJ, AM), pp. 296–306.
- DAC-1986-BhaskerS #algorithm #linear
- A linear algorithm to find a rectangular dual of a planar triangulated graph (JB, SS), pp. 108–114.
- DAC-1986-OrailogluG #representation
- Flow graph representation (AO, DG), pp. 503–509.
- STOC-1986-GalilKS #nondeterminism #on the #simulation #turing machine
- On Nontrivial Separators for k-Page Graphs and Simulations by Nondeterministic One-Tape Turing Machines (ZG, RK, ES), pp. 39–49.
- STOC-1986-Yannakakis
- Four Pages are Necessary and Sufficient for Planar Graphs (MY), pp. 104–108.
- CADE-1986-Eisinger #what
- What You Always Wanted to Know About Clause Graph Resolution (NE), pp. 316–336.
- CADE-1986-LoganantharajM #parallel #proving #theorem proving
- Parallel Theorem Proving with Connection Graphs (RL, RAM), pp. 337–352.
- CADE-1986-MurrayR #semantics
- Theory Links in Semantic Graphs (NVM, ER), pp. 353–364.
- PODS-1985-AusielloDM #concept #modelling #semantics
- Chordality Properties on Graphs and Minimal Conceptual Connections in Semantic Data Models (GA, AD, MM), pp. 164–170.
- FPCA-1985-SkedzielewskiW85 #data flow #optimisation
- Data Flow Graph Optimization in IF1 (SKS, MLW), pp. 17–34.
- DAC-1985-NgJ #approach #generative
- Generation of layouts from MOS circuit schematics: a graph theoretic approach (TKN, SLJ), pp. 39–45.
- STOC-1985-BollobasFF #algorithm #random
- An Algorithm for Finding Hamilton Cycles in a Random Graph (BB, TIF, AMF), pp. 430–439.
- STOC-1985-Harel #algorithm #linear #problem
- A Linear Time Algorithm for Finding Dominators in Flow Graphs and Related Problems (DH), pp. 185–194.
- STOC-1985-RaghavanT #array
- Provably Good Routing in Graphs: Regular Arrays (PR, CDT), pp. 79–87.
- STOC-1985-SuzukiNS #multi
- Multicommodity Flows in Planar Undirected Graphs and Shortest Paths (HS, TN, NS), pp. 195–204.
- PODS-1984-BuckleyS #concurrent #protocol #using
- Concurrency Control in Graph Protocols by Using Edge Locks (GNB, AS), pp. 45–50.
- PODS-1984-CosmadakisK #approach #dependence #functional
- Functional and Inclusion Dependencies: A Graph Theoretic Approach (SSC, PCK), pp. 29–37.
- VLDB-1984-Zhu #algorithm #database #recognition
- Line Graph of Gamma-Acyclic Database Schems and its Recognition Algorithm (YzZ), pp. 218–221.
- ICALP-1984-AfratiPP #complexity
- The Complexity of Cubical Graphs (FNA, CHP, GP), pp. 51–57.
- ICALP-1984-Welzl #encoding #formal method #graph grammar
- Encoding Graphs by Derivations and Implications for the Theory of Graph Grammars (EW), pp. 503–513.
- SIGIR-1984-HahnR #algorithm #approach #generative
- Computing text Constituency: An Algorithmic Approach to the Generation of Text Graphs (UH, UR), pp. 343–368.
- POPL-1984-Ossher #named
- Grids: A New Program Structuring Mechanism Based on Layered Graphs (HO), pp. 11–22.
- ICSE-1984-Tai #complexity #data flow #metric
- A Program Complexity Metric Based on Data Flow Information in Control Graphs (KCT), pp. 239–249.
- DAC-1984-KorsI #interactive
- An interactive electrical graph extractor (JLK, MI), pp. 624–628.
- DAC-1984-KozminskiK #algorithm
- An algorithm for finding a rectangular dual of a planar graph for use in area planning for VLSI integrated circuits (KK, EK), pp. 655–656.
- STOC-1984-BussS #on the
- On the Pagenumber of Planar Graphs (JFB, PWS), pp. 98–100.
- STOC-1984-HochbaumS #approximate #problem
- Powers of Graphs: A Powerful Approximation Technique for Bottleneck Problems (DSH, DBS), pp. 324–333.
- STOC-1984-Miller
- Finding Small Simple Cycle Separators for 2-Connected Planar Graphs (GLM), pp. 376–382.
- CADE-1984-Plaisted #analysis #dependence #proving #theorem proving #using
- Using Examples, Case Analysis, and Dependency Graphs in Theorem Proving (DAP), pp. 356–374.
- ICALP-1983-HambruschS #bound #problem
- Lower Bounds for Solving Undirected Graph Problems on VLSI (SEH, JS), pp. 292–303.
- ICALP-1983-YannakakisKCP #clustering
- Cutting and Partitioning a Graph aifter a Fixed Pattern (MY, PCK, SSC, CHP), pp. 712–722.
- POPL-1983-BackMR #algorithm #performance
- Derivation of Efficient DAG Marking Algorithms (RJB, HM, KJR), pp. 20–27.
- POPL-1983-Wegman #regular expression
- Summarizing Graphs by Regular Expressions (MNW), pp. 203–216.
- DAC-1983-FukunagaYSK #approach #using
- Placement of circuit modules using a graph space approach (KF, SY, HSS, TK), pp. 465–471.
- STOC-1983-BabaiL #canonical
- Canonical Labeling of Graphs (LB, EML), pp. 171–183.
- STOC-1983-FurerSS #bound #normalisation
- Normal Forms for Trivalent Graphs and Graphs of Bounded Valence (MF, WS, ES), pp. 161–170.
- GG-1982-JanssensR #generative
- Hypergraph systems generating graph languages (DJ, GR), pp. 172–185.
- GG-1982-Kaul #linear #parsing
- Parsing of graphs in linear time (MK), pp. 206–218.
- GG-1982-Meier #approach #database
- A graph-relational approach to geographic databases (AM), pp. 245–254.
- GG-1982-Messerschmidt #automation #natural language
- Graph transductions in the field of automatic translation of natural languages (JM), pp. 255–266.
- GG-1982-Schnitzler #morphism #problem
- The isomorphism problem is polynomially solvable for certain graph languages (MS), pp. 369–379.
- GG-1982-SiromoneyS #infinity
- Space-filling curves and infinite graphs (RS, KGS), pp. 380–391.
- GG-1982-Wankmuller #reduction
- Characterization of graph classes by forbidden structures and reductions (FW), pp. 405–414.
- SCC-1982-Chaitin
- Register Allocation & Spilling via Graph Coloring (GJC), pp. 98–105.
- SCC-1982-GrahamKM #execution #named #profiling
- gprof: a Call Graph Execution Profiler (SLG, PBK, MKM), pp. 120–126.
- SCC-1982-Marshall #compilation #linear
- The Linear Graph Package, a Compiler Building Environment (HZM), pp. 294–300.
- Best-of-PLDI-1982-Chaitin
- Register allocation and spilling via graph coloring (with retrospective) (GJC), pp. 66–74.
- Best-of-PLDI-1982-GrahamKM #execution #named #profiling
- gprof: a call graph execution profiler (with retrospective) (SLG, PBK, MKM), pp. 49–57.
- STOC-1982-AtallahK #array #problem
- Graph Problems on a Mesh-Connected Processor Array (MJA, SRK), pp. 345–353.
- STOC-1982-BabaiGM #bound #morphism #multi
- Isomorphism of Graphs with Bounded Eigenvalue Multiplicity (LB, DYG, DMM), pp. 310–324.
- STOC-1982-Bar-YehudaE #approximate #on the
- On Approximating a Vertex Cover for Planar Graphs (RBY, SE), pp. 303–309.
- STOC-1982-Wigderson #algorithm #approximate
- A New Approximate Graph Coloring Algorithm (AW), pp. 325–329.
- ILPC-1982-SebelikS82 #prolog #source code
- Graphs as Data in Prolog Programs (JS, PS), pp. 105–109.
- SIGMOD-1981-Levin #algebra
- Introduction to the DIAM Theory of Algebraic Access Graph (ML), pp. 40–48.
- VLDB-1981-Chase #database
- Join Graphs and Acyclic Database Schemes (KC), pp. 95–100.
- ICALP-1981-HongMR #trade-off
- Cost Tradeoffs in Graph Embeddings, with Applications (JWH, KM, ALR), pp. 41–55.
- POPL-1981-KuckKPLW #compilation #dependence #optimisation
- Dependence Graphs and Compiler Optimizations (DJK, RHK, DAP, BL, MW), pp. 207–218.
- STOC-1981-HongR
- Graphs that Are Almost Binary Trees (JWH, ALR), pp. 334–341.
- STOC-1981-KleitmanLLM
- New Layouts for the Shuffle-Exchange Graph (DJK, FTL, ML, GLM), pp. 278–292.
- STOC-1981-MullerS #automaton #higher-order #logic #problem #reachability
- Pushdown Automata, Graphs, Ends, Second-Order Logic, and Reachability Problems (DEM, PES), pp. 46–54.
- DAC-1980-CasavantGK #automation #dependence #design
- Automatic design with dependence graphs (AEC, DDG, DJK), pp. 506–515.
- STOC-1980-CarlsonS
- Graph Pebbling with Many Free Pebbles can be Difficult (DAC, JES), pp. 326–332.
- STOC-1980-FilottiM #algorithm #morphism #polynomial
- A Polynomial-time Algorithm for Determining the Isomorphism of Graphs of Fixed Genus (ISF, JNM), pp. 236–243.
- STOC-1980-Hoffmann #morphism #testing
- Testing Isomorphism on Cone Graphs (CMH), pp. 244–251.
- STOC-1980-Lichtenstein #morphism
- Isomorphism for Graphs Embeddable on the Projective Plane (DL), pp. 218–224.
- STOC-1980-Miller #bound #morphism #testing
- Isomorphism Testing for Graphs of Bounded Genus (GLM), pp. 225–235.
- STOC-1980-Storer #grid
- The Node Cost Measure for Embedding Graphs on the Planar Grid (JAS), pp. 201–210.
- STOC-1980-Strong #execution
- Vector Execution of Flow Graphs (HRS), pp. 108–116.
- ICALP-1979-Heide #comparison #game studies
- A Comparison Between Two Variations of a Pebble Game on Graphs (FMadH), pp. 411–421.
- ICALP-1979-KamimuraS
- DAGs and Chomsky Hierarchy (TK, GS), pp. 331–337.
- ICALP-1979-Karp #algorithm #analysis #probability
- Recent Advances in the Probabilistic Analysis of Graph-Theoretic Algorithms (RMK), pp. 338–339.
- ICALP-1979-Schmidt #source code
- Investigating Programs in Terms of Partial Graphs (GS), pp. 505–519.
- DAC-1979-Lauther #algorithm #representation
- A min-cut placement algorithm for general cell assemblies based on a graph representation (UL), pp. 1–10.
- STOC-1979-FilottiMR #on the
- On Determining the Genus of a Graph in O(v^O(g)) Steps (ISF, GLM, JHR), pp. 27–37.
- STOC-1979-Kosaraju79a #algorithm #array #parallel #performance #problem
- Fast Parallel Processing Array Algorithms for some Graph Problems (SRK), pp. 231–236.
- STOC-1979-ValdesTL #parallel #recognition
- The recognition of Series Parallel digraphs (JV, RET, ELL), pp. 1–12.
- ICALP-1978-ItaiR
- Covering a Graph by Circuits (AI, MR), pp. 289–299.
- GG-1978-GrotschN #parallel
- Explicit versus Implicit Parallel Rewriting on Graphs (EG, MN), pp. 237–254.
- GG-1978-Kreowski
- A Pumping Lemma for Context-Free Graph Languages (HJK), pp. 270–283.
- GG-1978-LuckL #2d #difference #generative #parallel
- Two-Dimensional, Differential, Intercalary Plant Tissue Growth and Parallel Graph Generating and Graph Recurrence Systems (JL, HBL), pp. 284–300.
- GG-1978-Pratt #programming language #semantics #using
- Definition of Programming Language Semantics Using Grammars for Hierarchical Graphs (TWP), pp. 389–400.
- GG-1978-Savitch
- Graphs of Processors (WJS), pp. 418–425.
- GG-1978-Sowa #concept
- Definitional Mechanisms for Conceptual Graphs (JFS), pp. 426–439.
- GG-1978-WuR #automaton
- Cellular Graph Automata (AYW, AR), pp. 464–475.
- ICSE-1978-BrownF #approach #verification
- A Graph Theoretic Approach to the Verification of Program Structures (JRB, KFF), pp. 136–141.
- DAC-1978-Huey #problem #reduction #using
- Guiding sensitization searches using problem reduction graphs (BH), pp. 312–320.
- DAC-1978-Ruch #approach #interactive #layout
- Interactive space layout: A graph theoretical approach (JR), pp. 152–157.
- STOC-1978-Filotti #algorithm #performance #polynomial
- An Efficient Algorithm for Determining Whether a Cubic Graph is Toroidal (ISF), pp. 133–142.
- STOC-1978-GabowK #algorithm
- Algorithms for Edge Coloring Bipartite Graphs (HNG, OK), pp. 184–192.
- STOC-1978-Lueker #problem
- Maximization Problems on Graphs with Edge Weights Chosen from a Normal Distribution (GSL), pp. 13–18.
- ICALP-1977-BackhouseL
- Factor Graphs, Failure Functions and BI-Trees (RCB, RKL), pp. 61–75.
- POPL-1977-ReifL #evaluation #symbolic computation
- Symbolic Evaluation and the Global Value Graph (JHR, HRL), pp. 104–118.
- STOC-1977-Itai
- Finding a Minimum Circuit in a Graph (AI), pp. 1–10.
- STOC-1977-Miller #morphism
- Graph Isomorphism, General Remarks (GLM), pp. 143–150.
- ICALP-1976-Fontet #algorithm #linear #morphism #testing
- A Linear Algorithm for Testing Isomorphism of Planar Graphs (MF), pp. 411–424.
- STOC-1976-FongU
- Finding the Depth of a Flow Graph (ACF, JDU), pp. 121–125.
- STOC-1976-PaulTC #bound #game studies
- Space Bounds for a Game of Graphs (WJP, RET, JRC), pp. 149–160.
- STOC-1975-AhoU
- Node Listings for Reducible Flow Graphs (AVA, JDU), pp. 177–185.
- STOC-1975-BoothL #algorithm #linear
- Linear Algorithms to Recognize Interval Graphs and Test for the Consecutive Ones Property (KSB, GSL), pp. 255–265.
- ICALP-1974-LipskiM
- File Organization, An Application of Graph Theory (WLJ, VWM), pp. 270–279.
- ICALP-1974-PaciniMT #recursion #representation
- Graph Representation and Computation Rules for Typeless Recursive Languages (GP, CM, FT), pp. 157–169.
- DAC-1974-CleemputL #formal method #layout #problem
- An improved graph-theoretic model for the circuit layout problem (WMvC, JGL), pp. 82–90.
- STOC-1974-HopcroftW #algorithm #linear #morphism
- Linear Time Algorithm for Isomorphism of Planar Graphs (JEH, JKW), pp. 172–184.
- STOC-1974-Kirkpatrick #matrix
- Determining Graph Properties from Matrix Representations (DGK), pp. 84–90.
- STOC-1974-Tarjan #testing
- Testing Graph Connectivity (RET), pp. 185–193.
- STOC-1973-Tarjan #testing
- Testing Flow Graph Reducibility (RET), pp. 96–107.
- STOC-1972-HechtU
- Flow Graph Reducibility (MSH, JDU), pp. 238–250.
- DAC-1971-Grason #approach #using
- An approach to computerized space planning using graph theory (JG), pp. 170–178.
- STOC-1971-Rosenberg
- Addressable Data Graphs: Extended Abstract (ALR), pp. 138–150.
- DAC-1970-Sr #analysis #clustering #logic #reduction
- Partitioning of logic graphs: A theoretical analysis of pin reduction (RBHS), pp. 54–63.
- STOC-1970-Rosenberg
- Data Graphs and Addressing Schemes: Extended Abstract (ALR), pp. 48–61.
- DAC-1968-Bernstein #analysis #online
- Electronic circuit analysis with on-line graphs via a time-sharing terminal (SB).
- LISP-1963-Hearn #lisp
- LISP. Computation of Feynman Graphs (ACH), p. 6.
